17 search results - page 4 / 4 » Approximate String Matching over Ziv-Lempel Compressed Text |
FOCS
2009
IEEE
14 years 2 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...
CIKM
2008
Springer
14 years 19 days ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...