56 search results - page 7 / 12 » K-Best Suffix Arrays |
ALGORITHMICA
2004
13 years 7 months ago
2004
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
CIKM
2005
Springer
14 years 27 days 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, ...
FCCM
2011
IEEE
12 years 11 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
CSB
2002
IEEE
14 years 10 days ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...