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