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