Three Heuristics for delta-Matching: delta-BM Algorithms
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter · Research Portal (King's College London) · 2002
We consider a version of pattern matching useful in processing large musical data: delta-matching, which consists in finding matches which are delta-approximate in the sense of the distance measured as maximum difference between symbols. The alphabet is an interval of integers, and the distance between two symbols a, b is measured as \a - b\. We present delta-matching algorithms fast on the average providing that the pattern is "non-flat" and the alphabet interval is large. The pattern is "flat" if its structure does not vary substantially. We also consider (delta, gamma)-matching, where 7 is a bound on the total number of errors. The algorithms, named delta-BM1, delta-BM2 and delta-BM3 can be thought as members of the generalized Boyer-Moore family of algorithms. The algorithms are fast on average. This is the first paper on the subject, previously only "occurrence heuristics" have been considered. Our heuristics are much stronger and refer to larger parts of texts (not only to single positions). We use delta-versions of suffix tries and subword graphs. Surprisingly, in the context of delta-matching subword graphs appear to be superior compared with compacted suffix trees.