preprint · HAL (Le Centre pour la Communication Scientifique Directe) · 2001

Approximate String Matching in Musical Sequences

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón

Cited by 17Open access

Abstract

Abstract. Here we consider computational problems on ffi-approximate and(ffi; fl)-approximate string matching. These are two new notions of approximate matching that arise naturally in applications of computer assisted music analy-sis. We present fast, efficient and practical algorithms for these two notions of approximate string matching.

Cite this paper

APA 7

Crochemore, M., Iliopoulos, C. S., Lecroq, T., & Pinzón, Y. J. (2001). Approximate String Matching in Musical Sequences. HAL (Le Centre pour la Communication Scientifique Directe).

MLA 9

Crochemore, Maxime, et al. “Approximate String Matching in Musical Sequences.” HAL (Le Centre pour la Communication Scientifique Directe), 2001.

Chicago

Crochemore, Maxime, Costas S. Iliopoulos, Thierry Lecroq, and Yoan J. Pinzón. 2001. “Approximate String Matching in Musical Sequences.” HAL (Le Centre pour la Communication Scientifique Directe).

Harvard

Crochemore, M. et al. (2001) ‘Approximate String Matching in Musical Sequences’, HAL (Le Centre pour la Communication Scientifique Directe).

BibTeX

@misc{crochemore2001approximate,
  title = {{Approximate String Matching in Musical Sequences}},
  author = {Crochemore, Maxime and Iliopoulos, Costas S. and Lecroq, Thierry and Pinzón, Yoan J.},
  journal = {HAL (Le Centre pour la Communication Scientifique Directe)},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.