{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T21:35:15Z","timestamp":1790804115599,"version":"4.1.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,13]],"date-time":"2009-06-13T00:00:00Z","timestamp":1244851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,6,13]],"date-time":"2009-06-13T00:00:00Z","timestamp":1244851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10791-009-9097-9","type":"journal-article","created":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T12:48:41Z","timestamp":1244810921000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Filtering methods for content-based retrieval on indexed symbolic music databases"],"prefix":"10.1007","volume":"13","author":[{"given":"Kjell","family":"Lemstr\u00f6m","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niko","family":"Mikkil\u00e4","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Veli","family":"M\u00e4kinen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,6,13]]},"reference":[{"issue":"4","key":"9097_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1142\/S0218195901000596","volume":"11","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., & Har-Peled, S. (2001). Polygon containment and translational min-hausdorff-distance between segment sets are\n\n                    3SUM\n                  -hard. The International Journal of Computational Geometry and Applications, 11(4), 465\u2013474.","journal-title":"The International Journal of Computational Geometry and Applications"},{"key":"9097_CR3","unstructured":"Clausen, M., Engelbrecht, R., Meyer, D., & Schmitz, J. (2000). Proms: A web-based tool for searching in polyphonic music. In Proceedings of ISMIR\u201900, Plymouth."},{"key":"9097_CR4","unstructured":"Clifford, R., Christodoulakis, M., Crawford, T., Meredith, D., & Wiggins, G. (2006). A fast, randomised, maximal subset matching algorithm for document-level music retrieval. In Proceedings of ISMIR\u201906 (pp. 150\u2013155), Victoria."},{"issue":"1","key":"9097_CR5","first-page":"54","volume":"9","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., & Tsichlas, K. (2002). Approximate string matching with gaps. Nordic Journal of Computing, 9(1), 54\u201365.","journal-title":"Nordic Journal of Computing"},{"issue":"4","key":"9097_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10791-008-9054-z","volume":"11","author":"K. Fredriksson","year":"2008","unstructured":"Fredriksson, K., & Grabowski, Sz. (2008). Efficient algorithms for pattern matching with general gaps, character classes and transposition invariance. Information Retrieval, 11(4), 335\u2013357.","journal-title":"Information Retrieval"},{"issue":"6","key":"9097_CR7","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1142\/S0129054106004455","volume":"17","author":"K. Fredriksson","year":"2006","unstructured":"Fredriksson, K., M\u00e4kinen, V., & Navarro, G. (2006). Flexible music retrieval in sublinear time. International Journal of Foundations of Computer Science (IJFCS), 17(6), 1345\u20131364.","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"9097_CR8","doi-asserted-by":"crossref","unstructured":"Ghias, A., Logan, J., Chamberlin, D., & Smith, B. (1995). Query by humming\u2014musical information retrieval in an audio database. In Proceedings of ACM multimedia (pp. 231\u2013236), San Francisco.","DOI":"10.1145\/217279.215273"},{"key":"9097_CR9","doi-asserted-by":"crossref","unstructured":"Lemstr\u00f6m, K., & Pienim\u00e4ki, A. (2007). On comparing edit distance and geometric frameworks in content-based retrieval of symbolically encoded polyphonic music. Musicae Scientiae, 4a, 135\u2013152 (discussion forum)","DOI":"10.1177\/102986490701100106"},{"key":"9097_CR10","unstructured":"Lubiw, A., & Tanur, L. (2004). Pattern matching in polyphonic music as a weighted geometric translation problem. In Proceedings of ISMIR\u201904 (pp. 289\u2013296), Barcelona."},{"issue":"2","key":"9097_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jalgor.2004.07.008","volume":"56","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G., & Ukkonen, E. (2005). Transposition invariant string matching. Journal of Algorithms, 56(2), 124\u2013153.","journal-title":"Journal of Algorithms"},{"key":"9097_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00117340","volume":"24","author":"M. Mongeau","year":"1990","unstructured":"Mongeau, M., & Sankoff, D. (1990). Comparison of musical sequences. Computers and the Humanities, 24, 161\u2013175.","journal-title":"Computers and the Humanities"},{"issue":"1","key":"9097_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G. (2001). A guided tour to approximate string matching. ACM Computing Survey, 33(1), 31\u201388.","journal-title":"ACM Computing Survey"},{"key":"9097_CR14","unstructured":"Typke, R. (2007). Music retrieval based on melodic similarity. PhD thesis, Utrecht University."},{"key":"9097_CR15","doi-asserted-by":"crossref","unstructured":"Uitdenbogerd, A., & Zobel, J. (1998). Manipulation of music for melody matching. In Proceedings of ACM multimedia (pp. 235\u2013240), Bristol.","DOI":"10.1145\/290747.290776"},{"key":"9097_CR16","unstructured":"Ukkonen, E., Lemstr\u00f6m, K., & M\u00e4kinen, V. (2003). Geometric algorithms for transposition invariant content-based music retrieval. In Proceedings of ISMIR\u201903 (pp. 193\u2013199), Baltimore."},{"key":"9097_CR17","unstructured":"Wiggins, G., Lemstr\u00f6m, K., & Meredith, D. (2002). SIA(M)ESE: An algorithm for transposition invariant, polyphonic content-based music retrieval. In Proceedings of ISMIR\u201902 (pp. 283\u2013284), Paris."}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9097-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-009-9097-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9097-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9097-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:46:46Z","timestamp":1704206806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-009-9097-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,13]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9097"],"URL":"https:\/\/doi.org\/10.1007\/s10791-009-9097-9","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,13]]},"assertion":[{"value":"27 June 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}