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