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