We present some combinatorial problems which arise in the fields of music representation and music processing, in particular in the context of analysis of the harmonic structure of chord sequences. We are mainly concerned with problems related to chord sequences which exhibit a certain kind of regular harmonic structure, and provide also algorithms to solve some of them. In particular, we present an O(n+m)-time algorithm, based on bit-parallelism, to check whether a given chord progression of length n is regular, where m is the size of the chords in the progression.
|Titolo:||On some combinatorial problems concerning the harmonic structure of musical chord sequences|
|Data di pubblicazione:||2008|
|Citazione:||On some combinatorial problems concerning the harmonic structure of musical chord sequences / CANTONE D; CRISTOFARO S; FARO S. - In: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. - ISSN 0129-0541. - 19:1(2008), pp. 103-124.|
|Appare nelle tipologie:||1.1 Articolo in rivista|