Three Heuristics for δ-Matching: δ-BM Algorithms

Abstract : We consider a version of pattern matching useful in processing large musical data: δ-matching, which consists in finding matches which are δ-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 δ-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 (δ, γ)- matching, where γ is a bound on the total number of errors. The algorithms, named δ-BM1, δ-BM2 and δ-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).
Document type :
Conference papers
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00619982
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, March 19, 2013 - 5:31:33 PM
Last modification on : Thursday, May 9, 2019 - 8:02:09 PM
Long-term archiving on: Tuesday, January 3, 2017 - 5:30:14 PM

File

cpm02.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619982, version 1

Citation

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. Three Heuristics for δ-Matching: δ-BM Algorithms. Symposium on Combinatorial Pattern Matching (CPM'2002), 2002, Japan. pp.178-189. ⟨hal-00619982⟩

Share

Metrics

Record views

244

Files downloads

219