38 search results - page 3 / 8 » Engineering a Lightweight Suffix Array Construction Algorith... |
113
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
95
Voted
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
BIRD
2007
Springer
15 years 5 months ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
TASLP
2010
14 years 6 months ago
2010
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
173
click to vote
ICDE
2004
IEEE
16 years 29 days ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...