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