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