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