{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:13Z","timestamp":1725564913710},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_31","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:00:15Z","timestamp":1283713215000},"page":"409-419","source":"Crossref","is-referenced-by-count":16,"title":["Faster Two Dimensional Pattern Matching with Rotations"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Kapah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dekel","family":"Tsur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"31_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching. Comm. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Comm. ACM"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-44888-8_2","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2003","unstructured":"Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M.: Two-dimensional pattern matching with rotations. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 17\u201331. Springer, Heidelberg (2003)"},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0020-0190(99)00060-5","volume":"70","author":"A. Amir","year":"1999","unstructured":"Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Information Processing Letters\u00a070(4), 185\u2013190 (1999)","journal-title":"Information Processing Letters"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-540-45078-8_31","volume-title":"Algorithms and Data Structures","author":"A. Amir","year":"2003","unstructured":"Amir, A., Butman, A., Lewenstein, M., Porat, E.: Real two dimensional scaled matching. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 353\u2013364. Springer, Heidelberg (2003)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(92)90206-B","volume":"44","author":"A. Amir","year":"1992","unstructured":"Amir, A., Farach, M.: Two dimensional dictionary matching. Information Processing Letters\u00a044, 233\u2013239 (1992)","journal-title":"Information Processing Letters"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90318-V","volume":"81","author":"A. Amir","year":"1991","unstructured":"Amir, A., Landau, G.: Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science\u00a081, 97\u2013115 (1991)","journal-title":"Theoretical Computer Science"},{"volume-title":"Pattern Matching Algorithms","year":"1997","key":"31_CR7","unstructured":"Apostolico, A., Galil, Z. (eds.): Pattern Matching Algorithms. Oxford University Press, Oxford (1997)"},{"key":"31_CR8","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"31_CR9","unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. Complexity of Computation. In: Karp, R.M. (ed.) SIAM-AMS Proceedings, 7th edn., pp. 113\u2013125 (1974)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-24698-5_8","volume-title":"LATIN 2004: Theoretical Informatics","author":"K. Fredriksson","year":"2004","unstructured":"Fredriksson, K., M\u00e4kinen, V., Navarro, G.: Rotation and lighting invariant template matching. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 39\u201348. Springer, Heidelberg (2004), \n                  \n                    http:\/\/www.dcc.uchile.cl\/~gnavarro\/ps\/latin04.ps.gzx"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-44929-9_5","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"K. Fredriksson","year":"2000","unstructured":"Fredriksson, K., Navarro, G., Ukkonen, E.: An index for two dimensional string matching allowing rotations. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 59\u201375. Springer, Heidelberg (2000)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45452-7_20","volume-title":"Combinatorial Pattern Matching","author":"K. Fredriksson","year":"2002","unstructured":"Fredriksson, K., Navarro, G., Ukkonen, E.: Optimal exact and fast approximate two dimensional pattern matching allowing rotations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 235\u2013248. Springer, Heidelberg (2002)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0030785","volume-title":"Combinatorial Pattern Matching","author":"K. Fredriksson","year":"1998","unstructured":"Fredriksson, K., Ukkonen, E.: A rotation invariant filter for two-dimensional string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 118\u2013125. Springer, Heidelberg (1998)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0030785","volume-title":"Combinatorial Pattern Matching","author":"K. Fredriksson","year":"1998","unstructured":"Fredriksson, K., Ukkonen, E.: A rotation invariant filter for two-dimensional string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 118\u2013125. Springer, Heidelberg (1998)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/SPIRE.2000.878184","volume-title":"Proc. 7th Symposium on String Processing and Information Retrieval (SPIRE 2000)","author":"K. Fredriksson","year":"2000","unstructured":"Fredriksson, K., Ukkonen, E.: Combinatorial methods for approximate pattern matching under rotations and translations in 3d arrays. In: Proc. 7th Symposium on String Processing and Information Retrieval (SPIRE 2000), pp. 96\u2013104. IEEE CS Press, Los Alamitos (2000)"},{"issue":"2","key":"31_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/inco.1996.0087","volume":"130","author":"R. Giancarlo","year":"1996","unstructured":"Giancarlo, R., Grossi, R.: On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation\u00a0130(2), 151\u2013182 (1996)","journal-title":"Information and Computation"},{"key":"31_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"3\/4","key":"31_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01185433","volume":"12","author":"G.M. Landau","year":"1994","unstructured":"Landau, G.M., Vishkin, U.: Pattern matching in a digitized image. Algorithmica\u00a012(3\/4), 375\u2013408 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:26:56Z","timestamp":1619998016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}