Identifying rhythms in musical texts

被引：3
|
作者：
Christodoulakis, Manolis [1 ]
Iliopoulos, Costas S. [1 ]
Rahman, M. Sohel [1 ]
Smyth, William F. [2 ,3 ]
机构：
[1] Kings Coll London, Dept Comp Sci, Algorithm Design Grp, London WC2R 2LS, England
[2] McMaster Univ, Dept Comp & Software, Algorithms Res Grp, Hamilton, ON L8S 4L8, Canada
[3] Curtin Univ, Dept Comp, Perth, WA, Australia
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2008年 / 19卷 / 01期
关键词：
algorithms; musical sequence; rhythm;
D O I：
10.1142/S0129054108005528
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：37 / 51
页数：15
相关论文
共 50 条
12345