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