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