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