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