{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:39Z","timestamp":1725559479987},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_37","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"428-439","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Algorithm for \u03b4-Approximate Matching with \u03b1-Bounded Gaps in Musical Sequences"],"prefix":"10.1007","author":[{"given":"Domenico","family":"Cantone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Cristofaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Faro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: Algorithms for computing approximate repetitions in musical sequences. In: Raman, R., Simpson, J. (eds.) Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, Perth, WA, Australia, pp. 129\u2013144 (1999)"},{"key":"37_CR2","unstructured":"Cantone, D., Cristofaro, S., Faro, S.: Efficient algorithms for the \u03b4-approximate string matching problem in musical sequences. In: Proc. of the Prague Stringology Conference 2004, Czech Technical University, Prague, Czech Republic, pp. 69\u201382 (2004)"},{"key":"37_CR3","first-page":"71","volume":"11","author":"T. Crawford","year":"1998","unstructured":"Crawford, T., Iliopoulos, C., Raman, R.: String matching techniques for musical similarity and melodic recognition. Computing in Musicology\u00a011, 71\u2013100 (1998)","journal-title":"Computing in Musicology"},{"key":"37_CR4","unstructured":"Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps (2002)"},{"key":"37_CR5","unstructured":"Crochemore, M., Iliopoulos, C.S., Lecroq, T., Pinzon, Y.J.: Approximate string matching in musical sequences. In: Bal\u00edk, M., \u0160im\u00e1nek, M. (eds.) Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, pp. 26\u201336 (2001), Annual Report DC\u20132001\u201306"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-45452-7_16","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Iliopoulos, C.S., Lecroq, T., Plandowski, W., Rytter, W.: Three heuristics for \u03b4-matching: \u03b4-BM algorithms. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 178\u2013189. Springer, Heidelberg (2002)"},{"key":"37_CR7","unstructured":"Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm for the longest common subsequence problem. In: Brankovic, L., Ryan, J. (eds.) Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, Hunter Valley, Australia, pp. 75\u201386 (2000)"},{"issue":"1","key":"37_CR8","first-page":"1","volume":"7","author":"J. Karhum\u00e4ki","year":"2000","unstructured":"Karhum\u00e4ki, J., Plandowski, W., Rytter, W.: Pattern-matching problems for two-dimensional images described by finite automata. Nordic J. Comput.\u00a07(1), 1\u201313 (2000)","journal-title":"Nordic J. Comput."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1073\/pnas.85.3.841","volume":"85","author":"S. Karlin","year":"1988","unstructured":"Karlin, S., Morris, M., Ghandour, G., Leung, M.Y.: Efficient algorithms for molecular sequence analysis. Proceedings of the National Academy of Science\u00a085, 841\u2013845 (1988)","journal-title":"Proceedings of the National Academy of Science"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:01:02Z","timestamp":1558296062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11427186_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}