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