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