Approximate String Matching over Ziv-Lempel Compressed Text (2000)
Cached
Download Links
- [www.dcc.uchile.cl]
- [www.dcc.uchile.cl]
- [www.dcc.uchile.cl]
- DBLP
Other Repositories/Bibliography
| Citations: | 38 - 11 self |
BibTeX
@MISC{Kärkkäinen00approximatestring,
author = {Juha Kärkkäinen and Gonzalo Navarro and Esko Ukkonen},
title = {Approximate String Matching over Ziv-Lempel Compressed Text},
year = {2000}
}
Years of Citing Articles
OpenURL
Abstract
We present the first nontrivial algorithm for approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences of the pattern in the text allowing up to k insertions, deletions and substitutions. On LZ78/LZW we need O(mkn + R) time in the worst case and O(k ) +R) on average where is the alphabet size. The experimental results show a practical speedup over the basic approach of up to 2X for moderate m and small k. We extend the algorithms to more general compression formats and approximate matching models.







