Computing evolutionary chains in musical sequences
The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2
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 efficient algorithms and implementations for solving them.
DOI :
10.37236/1604
Classification :
68T10, 68P10
Mots-clés : string algorithms, approximate string matching, dynamic programming, computer-assisted music analysis
Mots-clés : string algorithms, approximate string matching, dynamic programming, computer-assisted music analysis
@article{10_37236_1604,
author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinzon},
title = {Computing evolutionary chains in musical sequences},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {2},
doi = {10.37236/1604},
zbl = {0981.68140},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1604/}
}
TY - JOUR AU - Maxime Crochemore AU - Costas S. Iliopoulos AU - Yoan J. Pinzon TI - Computing evolutionary chains in musical sequences JO - The electronic journal of combinatorics PY - 2001 VL - 8 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.37236/1604/ DO - 10.37236/1604 ID - 10_37236_1604 ER -
Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon. Computing evolutionary chains in musical sequences. The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2. doi: 10.37236/1604
Cité par Sources :