Computing evolutionary chains in musical sequences (Q5942559)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing evolutionary chains in musical sequences |
scientific article; zbMATH DE number 1638983
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing evolutionary chains in musical sequences |
scientific article; zbMATH DE number 1638983 |
Statements
Computing evolutionary chains in musical sequences (English)
0 references
16 October 2001
0 references
Summary: 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.
0 references
string algorithms
0 references
approximate string matching
0 references
dynamic programming
0 references
computer-assisted music analysis
0 references