Volume: 19, Issue: 1(2008)
pp. 37-51 DOI: 10.1142/S0129054108005528
|
|
Abstract |
Full Text (PDF, 733KB)
|
References
|
 |
| Title: |
IDENTIFYING RHYTHMS IN MUSICAL TEXTS |
| Author(s): |
MANOLIS CHRISTODOULAKIS
http://www.dcs.kcl.ac.uk/adg Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, EnglandCOSTAS S. ILIOPOULOS
Supported by EPSRC and Royal Society grants.
http://www.dcs.kcl.ac.uk/adg Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, EnglandM. SOHEL RAHMAN
Supported by the Commonwealth Scholarship Commission in the UK under the Commonwealth Scholarship and Fellowship Plan (CSFP).
On Leave from Department of CSE, BUET, Dhaka-1000, Bangladesh.
http://www.dcs.kcl.ac.uk/adg Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, EnglandWILLIAM F. SMYTH
Supported in part by an NSERC grant.
http://www.cos.monaster.ca/cas/research/algorithms.htm Algorithms Research Group, Department of Computing and Software, McMaster University, Canada
Department of Computing, Curtin University, Perth, Western Australia, Australia
|
| History: |
Received 3 November 2007
Accepted 14 February 2007
|
| Abstract: |
A fundamental problem in music is to classify songs according to their rhythm. A rhythm is represented by a sequence of “Quick” (Q) and “Slow” (S) symbols, which correspond to the (relative) duration of notes, such that S = 2Q. In this paper, we present an efficient algorithm for locating the maximum-length substring of a music text t that can be covered by a given rhythm r. |
| Keywords: |
Algorithms; musical sequence; rhythm
|
|
|
