{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:26:55Z","timestamp":1725481615806},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403111"},{"type":"electronic","value":"9783540448884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44888-8_2","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T16:34:12Z","timestamp":1173112452000},"page":"17-31","source":"Crossref","is-referenced-by-count":8,"title":["Two-Dimensional Pattern Matching with Rotations"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayelet","family":"Butman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malka","family":"Schaps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. Generalized string matching. SIAM J. Comp., 16(6):1039\u20131051, 1987.","journal-title":"SIAM J. Comp."},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0020-0190(99)00060-5","volume":"70","author":"A. Amir","year":"1999","unstructured":"A. Amir, A. Butman, and M. Lewenstein. Real scaled matching. Information Processing Letters, 70(4):185\u2013190, 1999.","journal-title":"Information Processing Letters"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(92)90206-B","volume":"44","author":"A. Amir","year":"1992","unstructured":"A. Amir and M. Farach. Two dimensional dictionary matching. Information Processing Letters, 44:233\u2013239, 1992.","journal-title":"Information Processing Letters"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90318-V","volume":"81","author":"A. Amir","year":"1991","unstructured":"A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97\u2013115, 1991.","journal-title":"Theoretical Computer Science"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"A. Apostolico and Z. Galil (editors). Pattern Matching Algorithms. Oxford University Press, 1997.","DOI":"10.1093\/oso\/9780195113679.001.0001"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and G. Valiente. An image similarity measure based on graph matching. In Proc. of the 7th Symposium on String Processing and Information Retrieval (SPIRE\u20192000), pages 28\u201338. I.E.E.E. CS Press, 2000.","DOI":"10.1109\/SPIRE.2000.878177"},{"key":"2_CR7","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"2_CR8","unstructured":"M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113\u2013125, 1974."},{"key":"2_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-44929-9_5","volume-title":"Proc. IFIP International Conference on Theoretical Computer Science (IFIP TCS)","author":"K. Fredriksson","year":"2000","unstructured":"K. Fredriksson, G. Navarro, and E. Ukkonen. An index for two dimensional string matching allowing rotations. In Proc. IFIP International Conference on Theoretical Computer Science (IFIP TCS), volume 1872 of LNCS, pages 59\u201375. Springer, 2000."},{"key":"2_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45452-7_20","volume-title":"Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002)","author":"K. Fredriksson","year":"2002","unstructured":"K. Fredriksson, G. Navarro, and E. Ukkonen. Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. In Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), volume 2373 of LNCS, pages 235\u2013248. Springer, 2002."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0030785","volume-title":"Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM 98)","author":"K. Fredriksson","year":"1998","unstructured":"K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM 98), pages 118\u2013125. Springer, LNCS 1448, 1998."},{"key":"2_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. of the 7th Symposium on String Processing and Information Retrieval (SPIRE\u20192000), pages 96\u2013104. I.E.E.E. CS Press, 2000.","DOI":"10.1109\/SPIRE.2000.878184"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/inco.1996.0087","volume":"130","author":"R. Giancarlo","year":"1996","unstructured":"R. Giancarlo and R. Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation, 130(2):151\u2013182, 1996.","journal-title":"Information and Computation"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"2_CR15","unstructured":"G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford at the Clarendon Press, fifth edition, 1979."},{"key":"2_CR16","unstructured":"P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric matching under noise: Combinatorial bounds and algorithms. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 354\u2013360, 1999."},{"issue":"3\/4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01185433","volume":"12","author":"G. M. Landau","year":"1994","unstructured":"G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(3\/4):375\u2013408, 1994.","journal-title":"Algorithmica"},{"key":"2_CR18","unstructured":"L. Schulman and D. Cardoze. Pattern matching for spatial point sets. Proc. 39th IEEE FOCS, pages 156\u2013165, 1998."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44888-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T17:23:49Z","timestamp":1628529829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44888-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403111","9783540448884"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44888-8_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}