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