Algorithms For Computing Approximate Repetitions In Musical Sequences

Emilios Cambouropoulos (1) , Maxime Crochemore (2, 3) , Costas S. Iliopoulos (2) , Laurent Mouchard (2, 4) , Yoan J. Pinzón Ardila (5)

1 OFAI - Austrian Research Institute for Artificial Intelligence
2 DCS - Department of Computer Science
3 LIGM - Laboratoire d'Informatique Gaspard-Monge
4 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
5 Departamento de Ingeniería de Sistemas e Industrial

Here we introduce two new notions of approximate matching with application in computer assisted music analysis. We present algorithms for each notion of approximation: for approximate string matching and for computing approximate squares

Mots clés: string algorithms; approximate string matching; dynamic programming; computer-assisted music analysis

Domaines: Bio-informatique [q-bio.QM]; Bio-Informatique, Biologie Systémique [q-bio.QM]

Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón Ardila. Algorithms For Computing Approximate Repetitions In Musical Sequences. International Journal of Computer Mathematics, 2002, 79 (11), pp.1135-1148. ⟨10.1080/00207160213939⟩. ⟨hal-00465090⟩