{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:15:03Z","timestamp":1737090903385,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_20","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:55:29Z","timestamp":1179280529000},"page":"235-248","source":"Crossref","is-referenced-by-count":21,"title":["Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Fredriksson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"issue":"6","key":"20_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18(6):333\u2013340, 1975.","journal-title":"Commun. ACM"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539792226321","volume":"23","author":"A. Amir","year":"1994","unstructured":"A. Amir, G. Benson, and M. Farach. An alphabet independent approach to two-dimensional pattern matching. SIAM J. Comput., 23(2):313\u2013323, 1994.","journal-title":"SIAM J. Comput."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"A. Amir, A. Butman, M. Crochemore, G.M. Landau, and M. Schaps. Two-dimensional pattern matching with rotations. Submitted for publication, 2002.","DOI":"10.1007\/3-540-44888-8_2"},{"issue":"1","key":"20_CR4","first-page":"21","volume":"1","author":"R. Baeza-Yates","year":"2000","unstructured":"R. Baeza-Yates and G. Navarro. New models and algorithms for multidimensional approximate pattern matching. J. Discret. Algorithms, 1(1):21\u201349, 2000.","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(93)90250-D","volume":"45","author":"R. A. Baeza-Yates","year":"1993","unstructured":"R. A. Baeza-Yates and M. R\u00e9gnier. Fast two-dimensional pattern matching. Inf. Process. Lett., 45(1):51\u201357, 1993.","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/146370.146374","volume":"24","author":"L. G. Brown","year":"1992","unstructured":"L. G. Brown. A survey of image registration techniques. ACM Computing Surveys, 24(4):325\u2013376, 1992.","journal-title":"ACM Computing Surveys"},{"key":"20_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-58094-8_23","volume-title":"Proc. 5th Combinatorial Pattern Matching (CPM\u201994)","author":"W.I. Chang","year":"1994","unstructured":"W.I. Chang and T. Marr. Approximate string matching with local similarity. In Proc. 5th Combinatorial Pattern Matching (CPM\u201994), LNCS 807, pages 259\u2013273, 1994."},{"issue":"3\u2013-4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(99)00092-7","volume":"71","author":"M. Crochemore","year":"1999","unstructured":"M. Crochemore, A. Czumaj, L. Gcasieniec, T. Lecroq, W. Plandowski, and W. Rytter. Fast practical multi-pattern matching. Inf. Process. Lett., 71(3\u2013-4):107\u2013113, 1999.","journal-title":"Inf. Process. Lett."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"K. Fredriksson. Rotation invariant histogram filters for similarity and distance measures between digital images. In Proc. 7th String Processing and Information Retrieval (SPIRE\u20192000), pages 105\u2013115. IEEE CS Press, 2000.","DOI":"10.1109\/SPIRE.2000.878185"},{"key":"20_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0030785","volume-title":"Proc. 9th Combinatorial Pattern Matching (CPM\u201998)","author":"K. Fredriksson","year":"1998","unstructured":"K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Combinatorial Pattern Matching (CPM\u201998), LNCS 1448, pages 118\u2013125, 1998."},{"issue":"11\u2013-13","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/S0167-8655(99)00092-6","volume":"20","author":"K. Fredriksson","year":"1999","unstructured":"K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate image matching under translations and rotations. Patt. Recog. Letters, 20(11\u2013-13):1249\u20131258, 1999.","journal-title":"Patt. Recog. Letters"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate pattern matching under rotations and translations in 3d arrays. In Proc. 7th String Processing and Information Retrieval (SPIRE\u20192000), pages 96\u2013104. IEEE CS Press, 2000.","DOI":"10.1109\/SPIRE.2000.878184"},{"key":"20_CR13","series-title":"Lect Notes Comput Sci","first-page":"59","volume-title":"IFIP TCS2000","author":"G. Navarro","year":"2000","unstructured":"G. Navarro K. Fredriksson and E. Ukkonen. An index for two dimensional string matching allowing rotations. In J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses, and T. Ito, editors, IFIP TCS2000, LNCS 1872, pages 59\u201375, 2000."},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/S0097539794275872","volume":"29","author":"J. K\u00e4rkk\u00e4inen","year":"2000","unstructured":"J. K\u00e4rkk\u00e4inen and E. Ukkonen. Two-and higher-dimensional pattern matching in optimal expected time. SIAM J. Comput., 29(2):571\u2013589, 2000.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/0205003","volume":"5","author":"R. L. Rivest","year":"1976","unstructured":"R. L. Rivest. Partial-match retrieval algorithms. SIAM J. Comput., 5(1):19\u201350, 1976.","journal-title":"SIAM J. Comput."},{"issue":"10","key":"20_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83\u201391, 1992.","journal-title":"Commun. ACM"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0208029","volume":"8","author":"A. C. Yao","year":"1979","unstructured":"A. C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368\u2013387, 1979.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:13:03Z","timestamp":1737018783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}