Login
/
Register
Logged in as anonymous /
My BiBiServ
/
Logout
Search
?
Navigation
Tools
Alignment
AltAVist
ClustalW
dca
Dialign
E2G
JAli
OMA
PoSSuMsearch
PoSSuMsearch2
SWIFT Suit
Evolutionary Relationships
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
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
RNA Movies
RNAsifter
Previous Results
Framework/Cloud
Education
Dynamic Programming
ADP
Sequence Analysis
SADR
Administration
BiBiServ policies
BiBiServ Team
Impressum
license
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)
Fly_Pres
Metrans
Decomp
RNAsifter
genefisher2
acdc
KnotInFrame
Download
SciBrow
Roci
GUUGle
OMA
Wotd
SADR
CEGeD
SplitsTree
Wotd
Welcome
planACstar
FFGC
pknotsRG
SWIFT Suit
pAliKiss
Trace2PS
Bellman's GAP Cafe
Impressum
RNAhybrid
TALP
PoSSuMsearch2
AGT-SDP
newdist
ADP
References
PoSSuMsearch
BPR
AGenDA
GEvolutionS
REPuter
RNA Movies
WebService Linklist
RNAalishapes
TCRProfiler
AggloIndel
ClustalW
jPREdictor
Download
PREdictor
license
MoRAine
E2G
CG-CAT
Phase4
Welcome
Gecko
Welcome
RapidShapes
MGA
ROCOCO
AltAVist
References
Previous Results
AIM
InSilicoDicer
Dialign
SBBI
libfid
BiBiServ Team
JAli
mmfind
Unwords
paRNAss
Wotd
mkESA
DCJ
Locomotif
Statuscodes
BiBiServ policies
Rose
dca
XenDB
RNAforester
pKiss
RNAshapes
aCMs
GraphTeams