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).
The work of the three first authors was partially supported by NATO grant PST.CLG.977017.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Cambouropoulos, T. Crawford and C. S. Iliopoulos, Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects, In G. Wiggins, editor, Proceedings of the Artificial Intelligence and Simulation of Behaviour Symposium, The Society for the Study of Artificial Intelligence and Simulation of Behaviour, Edinburgh, UK, pp 42–47, 1999.
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard and Y. J. Pinzon, Algorithms for computing approximate repetitions in musical sequences. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, Perth, WA, Australia, pp 129–144, 1999.
T. Crawford, C. S. Iliopoulos and R. Raman, String Matching Techniques for Musical Similarity and Melodic Recognition, Computing in Musicology 11 (1998) 73–100.
M. Crochemore, A. Czumaj, L. Gcasieniec, S. Jarominek, T. Lecroq, W. Plandowski and W. Rytter, Speeding-up two string matching algorithms, Algorithmica 12(4/5) (1994) 247–267.
M. Crochemore, C. S. Iliopoulos, T. Lecroq and Y. J. Pinzon, Approximate string matching in musical sequences, In M. Balík and M. Simánek, editors, Proceedings of the Prague Stringology Conference’01, Prague, Tcheque Republic, 2001, Annual Report DC-2001-06, 26-36.
V. Fischetti, G. Landau, J. Schmidt and P. Sellers, Identifying periodic occurrences of a template with applications to protein structure, Proceedings of the 3rd Combinatorial Pattern Matching, Lecture Notes in Computer Science 644, pp. 111–120, 1992.
S. Karlin, M. Morris, G. Ghandour and M.-Y. Leung, Efficient algorithms for molecular sequences analysis, Proc. Natl. Acad. Sci. USA 85 (1988) 841–845.
P. McGettrick, MIDIMatch: Musical Pattern Matching in Real Time, MSc Dissertation, York University, UK, 1997.
A. Milosavljevic and J. Jurka, Discovering simple DNA sequences by the algorithmic significance method, Comput. Appl. Biosci. 9 (1993) 407–411.
P. A. Pevzner and W. Feldman, Gray Code Masks for DNA Sequencing by Hybridization, Genomics 23 (1993) 233–235.
P. Y. Rolland and J. G. Ganascia, Musical Pattern Extraction and Similarity Assessment, In E. Miranda, editor, Readings in Music and Artificial Intelligence, Harwood Academic Publishers, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crochemore, M., Iliopoulos, C.S., Lecroq, T., Plandowski, W., Rytter, W. (2002). Three Heuristics for δ-Matching: δ-BM Algorithms. In: Apostolico, A., Takeda, M. (eds) Combinatorial Pattern Matching. CPM 2002. Lecture Notes in Computer Science, vol 2373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45452-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-45452-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43862-5
Online ISBN: 978-3-540-45452-6
eBook Packages: Springer Book Archive