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