7 search results - page 2 / 2 » Boyer-Moore String Matching over Ziv-Lempel Compressed Text |
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
FOCS
2009
IEEE
15 years 1 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...