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