{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:17Z","timestamp":1775281217806,"version":"3.50.1"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,2]]},"abstract":"<jats:p> A fundamental problem in music is to classify songs according to their rhythm. A rhythm is represented by a sequence of \u201cQuick\u201d (Q) and \u201cSlow\u201d (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. <\/jats:p>","DOI":"10.1142\/s0129054108005528","type":"journal-article","created":{"date-parts":[[2008,2,20]],"date-time":"2008-02-20T04:46:31Z","timestamp":1203482791000},"page":"37-51","source":"Crossref","is-referenced-by-count":4,"title":["IDENTIFYING RHYTHMS IN MUSICAL TEXTS"],"prefix":"10.1142","volume":"19","author":[{"given":"MANOLIS","family":"CHRISTODOULAKIS","sequence":"first","affiliation":[{"name":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England"}]},{"given":"COSTAS S.","family":"ILIOPOULOS","sequence":"additional","affiliation":[{"name":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England"}]},{"given":"M. SOHEL","family":"RAHMAN","sequence":"additional","affiliation":[{"name":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England"}]},{"given":"WILLIAM F.","family":"SMYTH","sequence":"additional","affiliation":[{"name":"Algorithms Research Group, Department of Computing and Software, McMaster University, Canada"},{"name":"Department of Computing, Curtin University, Perth, Western Australia, Australia"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","volume-title":"PASCAL Programming for Music Research","author":"Brinkman Alexander R.","year":"1990"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1162\/014892603322730497"},{"key":"rf4","first-page":"227","volume":"11","author":"Crawford T.","journal-title":"Computing in Musicology"},{"key":"rf6","volume-title":"Representing Musical Structure","author":"Howell Peter","year":"1991"},{"key":"rf11","volume-title":"Computer Representations and Models in Music","author":"Marsden Alan","year":"1992"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00117340"},{"key":"rf13","volume-title":"Beyond MIDI: The Handbook of Musical Codes","author":"Selfridge-Field Eleanor","year":"1997"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02395372"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.2307\/3680941"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:29:13Z","timestamp":1565177353000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1142\/S0129054108005528"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005528","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}