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