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