Approximate string matching on Ziv-Lempel compressed text

KärkkäinenJuha, NavarroGonzalo, UkkonenEsko · Journal of Discrete Algorithms · 2003

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 ...

Read the paper · More papers on PaperTik