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