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