Approximate String Matching in Musical Sequences

Maxime Crochemore (1) , Costas S. Iliopoulos (2) , Thierry Lecroq (3) , Yoan J. Pinzon (2)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 DCS - Department of Computer Science
3 LIFAR - Laboratoire d'informatique fondamentale et appliquée de Rouen

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

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzon. Approximate String Matching in Musical Sequences. PSC'2001, Prague Stringoly Club (Prague, 2001), 2001, Czech Republic. pp.26-36. ⟨hal-00619981⟩