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