9 search results - page 1 / 2 » Suffix Tree Based VF-Coding for Compressed Pattern Matching |
DCC
2009
IEEE
14 years 7 months ago
2009
IEEE
CSB
2002
IEEE
14 years 1 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...
IJFCS
2008
13 years 7 months ago
2008
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...