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