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