The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximate...
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...