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