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