{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:35Z","timestamp":1759638215228},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_7","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"68-78","source":"Crossref","is-referenced-by-count":15,"title":["Faster Algorithms for \u03b4,\u03b3-Matching and Related Problems"],"prefix":"10.1007","author":[{"given":"Peter","family":"Clifford","sequence":"first","affiliation":[]},{"given":"Rapha\u00ebl","family":"Clifford","sequence":"additional","affiliation":[]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM journal on Computing\u00a016(6), 1039\u20131051 (1987)","journal-title":"SIAM journal on Computing"},{"key":"7_CR2","unstructured":"Amir, A.: Private communication (2004)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1047","volume":"118","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M.: Efficient 2-dimensional approximate matching of halfrectangular figures. Information and Computation\u00a0118(1), 1\u201311 (1995)","journal-title":"Information and Computation"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11496656_9","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2005","unstructured":"Amir, A., Lipsky, O., Porat, E., Umanski, J.: Approximate matching in the L1 metric. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 91\u2013103. Springer, Heidelberg (2005)"},{"issue":"11","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1080\/00207160213939","volume":"79","author":"E. Cambouropoulos","year":"2002","unstructured":"Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: Computing approximate repetitions in musical sequences. International Journal of Computer Mathematics\u00a079(11), 1135\u20131148 (2002)","journal-title":"International Journal of Computer Mathematics"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Clifford, R., Crawford, T., Iliopoulos, C., Meredith, D.: String matching techniques for music analysis. In: String Algorithmics. NATO book series. KCL Press (2004)","DOI":"10.1007\/s00500-004-0384-5"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"7_CR8","unstructured":"Cole, R., Hariharan, R., Indyk, P.: Fast algorithms for subset matching and tree pattern matching (preprint)"},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0020-0190(02)00430-1","volume":"85","author":"R. Cole","year":"2003","unstructured":"Cole, R., Iliopoulos, C., Lecroq, T., Plandowski, W., Rytter, W.: On special families of morphisms related to \u03b4-matching and don\u2019t care symbols. Information Processing Letters\u00a085(5), 227\u2013233 (2003)","journal-title":"Information Processing Letters"},{"key":"7_CR10","unstructured":"Cope, D.: Pattern-matching as an engine for the computer simulation of musical style. In: Proceedings of the International Computer Music Conference, pp. 288\u2013291 (1990)"},{"key":"7_CR11","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"7_CR12","first-page":"73","volume-title":"Computing in Musicology","author":"T. Crawford","year":"1998","unstructured":"Crawford, T., Iliopoulos, C.S., Raman, R.: String-matching techniques for musical similarity and melodic recognition. In: Computing in Musicology, vol.\u00a011, pp. 73\u2013100. MIT-Press, Cambridge (1998)"},{"key":"7_CR13","unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) Proceedings of the 7th SIAM-AMS Complexity of Computation, pp. 113\u2013125 (1974)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/978-3-540-27836-8_66","volume-title":"Automata, Languages and Programming","author":"P. Indyk","year":"2004","unstructured":"Indyk, P., Lewenstein, M., Lipsky, O., Porat, E.: Closest pair problems in very high dimensions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 782\u2013792. Springer, Heidelberg (2004)"},{"key":"7_CR15","unstructured":"Porat, E.: Private communication (2004)"},{"key":"7_CR16","unstructured":"Rolland, P.Y., Ganascia, J.G.: Musical pattern extraction and similarity assessment. In: Miranda, E. (ed.) Readings in Music and Artificial Intelligence, pp. 115\u2013144. Harwood Academic Publishers (2000)"},{"issue":"5","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1137\/S1064827593247023","volume":"17","author":"J.C. Schatzman","year":"1996","unstructured":"Schatzman, J.C.: Accuracy of the discrete Fourier transform and the fast Fourier transform. SIAM Journal of Scientific Computing\u00a017(5), 1150\u20131166 (1996)","journal-title":"SIAM Journal of Scientific Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:26Z","timestamp":1605643226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11496656_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}