Occurrence and substring heuristics for δ-matching

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 also consider (δ, γ)-matching, where γ is a bound on the total sum of the differences. We first consider "occurrence heuristics" by adapting exact string matching algorithms to the two notions of approximate string matching. The resulting algorithms are efficient in practice. Then we consider "substring heuristics". 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. 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 substring heuristics are much stronger and refer to larger parts of texts (not only to single positions). We use δ-versions of suffix tries and subword graphs. Surprisingly, in the context of δ-matching subword graphs appear to be superior compared with compact suffix trees.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00619565
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, March 19, 2013 - 5:06:23 PM
Last modification on : Thursday, May 9, 2019 - 8:02:09 PM
Long-term archiving on: Thursday, June 20, 2013 - 4:20:57 PM

File

fi.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619565, version 1

Citation

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzon, Wojciech Plandowski, et al.. Occurrence and substring heuristics for δ-matching. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2003, 56 (1,2), pp.1-21. ⟨hal-00619565⟩

Share

Metrics

Record views

269

Files downloads

159