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