Algorithms for computing evolutionary chains in molecular and musical sequences

Maxime Crochemore (1) , Costas S. Iliopoulos (2) , Hiafeng Yu (2)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 DCS - Department of Computer Science

Musical patterns that recur in approximate, rather than identical, form within the body of a musical work are considered to be of considerable importance in music analysis. Here we consider the "evolutionary chain problem": this is the problem of computing a chain of all "motif" recurrences, each of which is a transformation of ("similar" to) the original motif, but each of which may be progressively further from the original. Here we consider several variants of the evolutionary chain problem and we present e cient algorithms and implementations for solving them.

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

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

Maxime Crochemore, Costas S. Iliopoulos, Hiafeng Yu. Algorithms for computing evolutionary chains in molecular and musical sequences. Proceedings of the ninth Australian Workshop on Combinatorial Algorithms AWOCA'98 (Perth, 1998), 1998, France. pp.172-184. ⟨hal-00619988⟩