Abstract
We present a new efficient algorithm for the δ-approximate matching problem with α-bounded gaps. The δ-approximate matching problem, recently introduced in connection with applications in music retrieval, generalizes the exact string matching problem by relaxing the notion of matching. Here we consider the case in which matchings may contain bounded gaps.
An extensive comparison with the only (to our knowledge) other solution existing in the literature for the same problem, due to Crochemore et al., indicates that our algorithm is more efficient, especially in the cases of large alphabets and long patterns. In addition, our algorithm computes the total number of approximate matchings for each position of the text, requiring only \({\mathcal O}(m\alpha)\)-space, where m is the length of the pattern.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: Algorithms for computing approximate repetitions in musical sequences. In: Raman, R., Simpson, J. (eds.) Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, Perth, WA, Australia, pp. 129–144 (1999)
Cantone, D., Cristofaro, S., Faro, S.: Efficient algorithms for the δ-approximate string matching problem in musical sequences. In: Proc. of the Prague Stringology Conference 2004, Czech Technical University, Prague, Czech Republic, pp. 69–82 (2004)
Crawford, T., Iliopoulos, C., Raman, R.: String matching techniques for musical similarity and melodic recognition. Computing in Musicology 11, 71–100 (1998)
Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps (2002)
Crochemore, M., Iliopoulos, C.S., Lecroq, T., Pinzon, Y.J.: Approximate string matching in musical sequences. In: Balík, M., Šimánek, M. (eds.) Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, pp. 26–36 (2001), Annual Report DC–2001–06
Crochemore, M., Iliopoulos, C.S., Lecroq, T., Plandowski, W., Rytter, W.: Three heuristics for δ-matching: δ-BM algorithms. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 178–189. Springer, Heidelberg (2002)
Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm for the longest common subsequence problem. In: Brankovic, L., Ryan, J. (eds.) Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, Hunter Valley, Australia, pp. 75–86 (2000)
Karhumäki, J., Plandowski, W., Rytter, W.: Pattern-matching problems for two-dimensional images described by finite automata. Nordic J. Comput. 7(1), 1–13 (2000)
Karlin, S., Morris, M., Ghandour, G., Leung, M.Y.: Efficient algorithms for molecular sequence analysis. Proceedings of the National Academy of Science 85, 841–845 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cantone, D., Cristofaro, S., Faro, S. (2005). An Efficient Algorithm for δ-Approximate Matching with α-Bounded Gaps in Musical Sequences. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_37
Download citation
DOI: https://doi.org/10.1007/11427186_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)