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)
AGenDA
SWIFT Suit
SplitsTree
JAli
GraphTeams
pknotsRG
OMA
Intronserter
AltAVist
RNAsifter
RNAforester
WebService Linklist
newdist
RNAhybrid
Previous Results
SciBrow
PoSSuMsearch
Trace2PS
TCRProfiler
license
Dialign
RapidShapes
MoRAine
Statuscodes
planACstar
XenDB
AGT-SDP
References
Phase4
pAliKiss
RNAshapes
privacy policy
Impressum
Rose
AIM
paRNAss
Fly_Pres
Roci
acdc
libfid
InSilicoDicer
ClustalW
GUUGle
MGA
KnotInFrame
jPREdictor
genefisher2
mmfind
Welcome
Gecko
Wotd
Bellman's GAP Cafe
Welcome
TALP
Download
dca
pKiss
BiBiServ Team
SBBI
AggloIndel
RNAalishapes
Wotd
mkESA
Metrans
aCMs
References
PREdictor
Download
BiBiServ policies
Unwords
ConCysFind
SADR
ROCOCO
Welcome
CG-CAT
BPR
Locomotif
Wotd
ADP
DCJ
Decomp
E2G
CEGeD
PoSSuMsearch2
GEvolutionS
REPuter
FFGC