Login
Logged in as anonymous /
My BiBiServ
/
Logout
Search
?
Navigation
Tools
Alignment
AltAVist
ClustalW
dca
Dialign
E2G
JAli
OMA
PoSSuMsearch
PoSSuMsearch2
SWIFT Suit
Evolutionary Relationships
ConCysFind
Roci
ROCOCO
Rose
SplitsTree
Genome Comparison
AGenDA
AggloIndel
CEGeD
CG-CAT
DCJ
FFGC
Gecko
GEvolutionS
GraphTeams
MGA
newdist
REPuter
SBBI
TCRProfiler
Others
acdc
AGT-SDP
AIM
BPR
Decomp
Fly_Pres
Intronserter
jPREdictor
libfid
Metrans
mkESA
mmfind
MoRAine
Phase4
PREdictor
SciBrow
TALP
Trace2PS
Unwords
Wotd
XenDB
Primer Design
genefisher2
RNA
Shapes Studio
KnotInFrame
pAliKiss
pKiss
pknotsRG
RapidShapes
RNAalishapes
RNAshapes
aCMs
GUUGle
InSilicoDicer
Locomotif
paRNAss
planACstar
RNAforester
RNAhybrid
RNAsifter
Previous Results
Framework/Cloud
Education
Dynamic Programming
ADP
Sequence Analysis
SADR
Administration
BiBiServ policies
BiBiServ Team
Impressum
license
privacy policy
Statuscodes
Wotd
Welcome
Download
References
Authors: S. Kurtz, R. Giegerich, J. Stoye
Wotd is an implementation of the ''lazy'' write-only top-down construction algorithm of suffix trees using a very space-efficient representation.
Users of Wotd are requested to cite :
Giegerich, Robert and Kurtz, Stefan and Stoye, Jens
Efficient implementation of lazy suffix trees
, Software - Practise and Experience, 2003
built on March 4 2015 (1:d0ba4790fd33)
InSilicoDicer
ClustalW
pKiss
Wotd
Gecko
Unwords
SWIFT Suit
Download
TCRProfiler
planACstar
dca
GUUGle
TALP
Metrans
Locomotif
MGA
ADP
SplitsTree
AGenDA
KnotInFrame
Wotd
GEvolutionS
AltAVist
CG-CAT
OMA
SciBrow
BPR
RNAforester
RNAhybrid
Wotd
REPuter
Welcome
Intronserter
E2G
AIM
aCMs
References
Previous Results
PoSSuMsearch
BiBiServ Team
RNAshapes
pknotsRG
SBBI
Fly_Pres
RNAsifter
mkESA
newdist
XenDB
Welcome
mmfind
SADR
WebService Linklist
AggloIndel
paRNAss
Statuscodes
RNAalishapes
Rose
AGT-SDP
RapidShapes
Decomp
libfid
Download
CEGeD
PREdictor
DCJ
license
genefisher2
ConCysFind
Bellman's GAP Cafe
Phase4
ROCOCO
GraphTeams
References
JAli
pAliKiss
FFGC
acdc
jPREdictor
Trace2PS
Dialign
MoRAine
Roci
Welcome
privacy policy
BiBiServ policies
PoSSuMsearch2
Impressum