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