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