{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:24:56Z","timestamp":1777645496245,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p>Existing symbolic music comparison systems generally consider\n\t\t\t monophonic music or monophonic reduction of polyphonic music. Adaptation of\n\t\t\t alignment algorithms to music leads to accurate systems, but their extensions\n\t\t\t to polyphonic music raise new problems. Indeed, a chord may match several\n\t\t\t consecutive notes, or the difference between two similar motifs may be a few\n\t\t\t swapped notes. Moreover, the substitution scores between chords are difficult \n\t\t\t to set up. In this paper, we propose a general framework for polyphonic music\n\t\t\t using the substitution score scheme set for monophonic music, which allows new\n\t\t\t operations by extending the operations proposed by Mongeau and Sankoff [15].\n\t\t\t From a practical point of view, the limitation of chord sizes and the number of\n\t\t\t notes that can be merged consecutively lead to a complexity that remains\n\t\t\t quadratic.<\/jats:p>","DOI":"10.3233\/fi-2009-205","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:06:55Z","timestamp":1575328015000},"page":"331-346","source":"Crossref","is-referenced-by-count":0,"title":["Toward a General Framework for Polyphonic Comparison"],"prefix":"10.1177","volume":"97","author":[{"given":"Julien","family":"Allali","sequence":"first","affiliation":[{"name":"LaBRI - Universit\u00e9 de Bordeaux 1 F-33405\r\t\t\t Talence cedex, France. E-mail: {julien.allali,pierre.hanna,matthias.robine}@labri.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Ferraro","sequence":"additional","affiliation":[{"name":"Pacific Institute For the Mathematical Sciences,\r\t\t\t University of Calgary, Canada. E-mail: pascal.ferraro@labri.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Hanna","sequence":"additional","affiliation":[{"name":"LaBRI - Universit\u00e9 de Bordeaux 1 F-33405\r\t\t\t Talence cedex, France. E-mail: {julien.allali,pierre.hanna,matthias.robine}@labri.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[{"name":"King's College - London, England. E-mail: costas.iliopoulos@kings.uk"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Robine","sequence":"additional","affiliation":[{"name":"LaBRI - Universit\u00e9 de Bordeaux 1 F-33405\r\t\t\t Talence cedex, France. E-mail: {julien.allali,pierre.hanna,matthias.robine}@labri.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-205","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:23Z","timestamp":1777444343000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.3233\/FI-2009-205"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-205","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}