Name
Abstract | ||
|---|---|---|
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 ecient algorithms and implementations for solving them. |
Year | Venue | Keywords |
|---|---|---|
2001 | Electr. J. Comb. | approximate string matching,string algorithms,computer- assisted music analysis.,dynamic programming,music analysis |
Field | DocType | Volume |
Dynamic programming,Combinatorics,Music theory,Musical,Motif (music),Theoretical computer science,Approximate string matching,Evolutionary music,Mathematics | Journal | 8 |
Issue | Citations | PageRank |
2 | 4 | 0.53 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maxime Crochemore | 1 | 2655 | 281.75 |
| Costas S. Iliopoulos | 2 | 1534 | 167.43 |
| Yoan J. Pinzon | 3 | 158 | 16.81 |