Computing Evolutionary Chains in Musical Sequences

Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon

Computing Evolutionary Chains in Musical Sequences

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon

Informatics

Research output: Contribution to journal › Article › peer-review

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 efficient algorithms and implementations for solving them.

Original language	English
Article number	N/A
Pages (from-to)	N/A
Number of pages	16
Journal	ELECTRONIC JOURNAL OF COMBINATORICS
Volume	8
Issue number	2
Publication status	Published - 2001

Access to Document

http://www.combinatorics.org/ojs/index.php/eljc/article/view/v8i2r5

Cite this

@article{0de27371a97242ec9a63681a956b5e15,

title = "Computing Evolutionary Chains in Musical Sequences",

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 efficient algorithms and implementations for solving them.",

author = "Maxime Crochemore and Iliopoulos, {Costas S.} and Pinzon, {Yoan J.}",

year = "2001",

language = "English",

volume = "8",

pages = "N/A",

journal = "ELECTRONIC JOURNAL OF COMBINATORICS",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2",

}

TY - JOUR

T1 - Computing Evolutionary Chains in Musical Sequences

AU - Crochemore, Maxime

AU - Iliopoulos, Costas S.

AU - Pinzon, Yoan J.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

M3 - Article

SN - 1077-8926

VL - 8

SP - N/A

JO - ELECTRONIC JOURNAL OF COMBINATORICS

JF - ELECTRONIC JOURNAL OF COMBINATORICS

IS - 2

M1 - N/A

ER -

Computing Evolutionary Chains in Musical Sequences

Abstract

Access to Document

Fingerprint

Cite this