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