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