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... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44411-4_19 | Conference on Current Trends in Theory and Practice of Informatics |
Keywords | Field | DocType |
music analysis,approximate string matching,musical pattern,fast evolutionary chains,considerable importance,string algorithms,original motif,evolutionary chain problem,computer-assisted music analysis.,dynamic programming,efficient algorithm,musical work | Approximation algorithm,Dynamic programming,Discrete mathematics,Music theory,Evolutionary algorithm,Algorithm complexity,Computer science,Musical,Algorithm,Theoretical computer science,Motif (music),Interval (music) | Conference |
Volume | ISSN | ISBN |
1963 | 0302-9743 | 3-540-41348-0 |
Citations | PageRank | References |
1 | 0.40 | 11 |
Authors | ||
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 |