Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Approximate Musical Evolution

  • Published:
Computers and the Humanities Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Berkman, O., C. S. Iliopoulos and K. Park. “String Covering”. Information and Computation, 123 (1996), 127–137.

    Google Scholar 

  • Cambouropoulos, E. “A General Pitch Interval Representation: Theory and Applications”. Journal of New Music Research, 25 (1996), 231–251.

    Google Scholar 

  • Cambouropoulos, E., T. Crawford and C. S. Iliopoulos. “Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects”. Special Issue on Pattern Processing in Music Analysis and Creation, Computers and the Humanities, this issue, 2000.

  • Crawford T., C. S. Iliopoulos and R. Raman. “String Matching Techniques for Musical Similarity and Melodic Recognition”. Computing in Musicology, 11 (1998), 73–100.

    Google Scholar 

  • Crochemore, M., C. S. Iliopoulos and H. Yu. “Algorithms for Computing Evolutionary Chains in Molecular and Musical Sequences”. Proceedings of the Ninth Australasian Workshop on Combinatorial Algorithms (1998), 172–184.

  • Landau, G. M. and U. Vishkin. “Fast Parallel and Serial Approximate String Matching”. Journal of Algorithms, 10 (1989), 157–169.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Music Department, King's College London, UK

    Tim Crawford

  2. Department of Computer Science, King's College London, UK

    Costas S. Iliopoulos, Russel Winder & Haifeng Yu

Authors
  1. Tim Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Russel Winder
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Haifeng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crawford, T., Iliopoulos, C.S., Winder, R. et al. Approximate Musical Evolution. Computers and the Humanities 35, 55–64 (2001). https://doi.org/10.1023/A:1002751519919

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1002751519919

Keywords

Search

Navigation