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