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