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