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