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