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