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