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