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