Algorithms for computing evolutionary chains in molecular and 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 e cient algorithms and implementations for solving them.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00619988
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, March 26, 2013 - 10:54:52 PM
Last modification on : Thursday, April 19, 2018 - 2:24:03 PM
Long-term archiving on: Thursday, June 27, 2013 - 2:35:10 AM

File

9807-EC.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619988, version 1

Collections

Citation

Maxime Crochemore, Costas S. Iliopoulos, Hiafeng Yu. Algorithms for computing evolutionary chains in molecular and musical sequences. Proceedings of the ninth Australian Workshop on Combinatorial Algorithms AWOCA'98 (Perth, 1998), 1998, France. pp.172-184. ⟨hal-00619988⟩

Share

Metrics

Record views

181

Files downloads

79