Abstract | ||
---|---|---|
Musical patterns that recur in approximate, rather thanidentical, form within a composition (or body of musical work)are considered to be of considerable importance in musicanalysis. 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 is progressivelyfurther from the original. Here we consider several variants ofthe evolutionary chain problem and we present efficientalgorithms for solving them. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1023/A:1002751519919 | Computers and the Humanities |
Keywords | DocType | Volume |
Computational Linguistic,Considerable Importance,Original Motif,Musical Work,Chain Problem | Journal | 35 |
Issue | ISSN | Citations |
1 | 1572-8412 | 2 |
PageRank | References | Authors |
0.51 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tim Crawford | 1 | 231 | 28.95 |
Costas S. Iliopoulos | 2 | 1534 | 167.43 |
Russel L. Winder | 3 | 47 | 9.98 |
Haifeng Yu | 4 | 2 | 0.51 |