{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:31Z","timestamp":1792111471716,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":16,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_444","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:32:23Z","timestamp":1553095943000},"page":"2278-2282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Dimensional Scaled Pattern Matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"2","key":"444_CR20343","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539792226321","volume":"23","author":"A Amir","year":"1994","unstructured":"Amir A, Benson G, Farach M (1994) An alphabet independent approach to two dimensional pattern matching. SIAM J Comput 23(2):313\u2013323","journal-title":"SIAM J Comput"},{"issue":"1\u20132","key":"444_CR20344","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2003.10.039","volume":"314","author":"A Amir","year":"2004","unstructured":"Amir A, Butman A, Crochemore M, Landau GM, Schaps M (2004) Two-dimensional pattern matching with rotations. Theor Comput Sci 314(1\u20132):173\u2013187","journal-title":"Theor Comput Sci"},{"issue":"4","key":"444_CR20345","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 (1999) Real scaled matching. Inf Process Lett 70(4):185\u2013190","journal-title":"Inf Process Lett"},{"key":"444_CR20346","doi-asserted-by":"crossref","unstructured":"Amir A, Butman A, Lewenstein M, Porat E (2003) Real two dimensional scaled matching. In: Proceedings of the 8th workshop on algorithms and data structures (WADS '03), pp 353\u2013364","DOI":"10.1007\/978-3-540-45078-8_31"},{"key":"444_CR20347","doi-asserted-by":"crossref","unstructured":"Amir A, Butman A, Lewenstein M, Porat E, Tsur D (2004) Efficient one dimensional real scaled matching. In: Proceedings of the 11th symposium on string processing and information retrieval (SPIRE'04), pp 1\u20139","DOI":"10.1007\/978-3-540-30213-1_1"},{"key":"444_CR20348","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/jagm.2000.1081","volume":"36","author":"A Amir","year":"2000","unstructured":"Amir A, Calinescu G (2000) Alphabet independent and dictionary scaled matching. J Algorithm 36:34\u201362","journal-title":"J Algorithm"},{"key":"444_CR20349","doi-asserted-by":"crossref","unstructured":"Amir A, Chencinski E (2006) Faster two dimensional scaled matching. In: Proceedings of the 17th symposium on combinatorial pattern matching (CPM). LNCS, vol 4009. Springer, Berlin, pp 200\u2013210","DOI":"10.1007\/11780441_19"},{"key":"444_CR20350","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 (1992) Two dimensional dictionary matching. Inf Process Lett 44:233\u2013239","journal-title":"Inf Process Lett"},{"key":"444_CR20351","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 (1991) Fast parallel and serial multidimensional approximate array matching. Theor Comput Sci 81:97\u2013115","journal-title":"Theor Comput Sci"},{"issue":"1","key":"444_CR20352","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0196-6774(92)90003-U","volume":"13","author":"A Amir","year":"1992","unstructured":"Amir A, Landau GM, Vishkin U (1992) Efficient pattern matching with scaling. J Algorithm 13(1):2\u201332","journal-title":"J Algorithm"},{"key":"444_CR20353","doi-asserted-by":"crossref","unstructured":"Amir A, Tsur D, Kapah O (2004) Faster two dimensional pattern matching with rotations. In: Proceedings of the 15th annual symposium on combinatorial pattern matching (CPM '04), pp 409\u2013419","DOI":"10.1007\/978-3-540-27801-6_31"},{"key":"444_CR20354","doi-asserted-by":"crossref","unstructured":"Fredriksson K, M\u00e4kinen V, Navarro G (2004) Rotation and lighting invariant template matching. In: Proceedings of the 6th Latin American symposium on theoretical informatics (LATIN'04). LNCS, pp 39\u201348","DOI":"10.1007\/978-3-540-24698-5_8"},{"key":"444_CR20355","doi-asserted-by":"crossref","unstructured":"Fredriksson K, Navarro G, Ukkonen E (2002) Optimal exact and fast approximate two dimensional pattern matching allowing rotations. In: Proceedings of the 13th annual symposium on combinatorial pattern matching (CPM 2002). LNCS, vol 2373, pp 235\u2013248","DOI":"10.1007\/3-540-45452-7_20"},{"key":"444_CR20356","doi-asserted-by":"crossref","unstructured":"Fredriksson K, Ukkonen E (1998) A rotation invariant filter for two-dimensional string matching. In: Proceedings of the 9th annual symposium on combinatorial pattern matching (CPM). LNCS, vol 1448. Springer, Berlin, pp 118\u2013125","DOI":"10.1007\/BFb0030785"},{"issue":"3\/4","key":"444_CR20357","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01185433","volume":"12","author":"GM Landau","year":"1994","unstructured":"Landau GM, Vishkin U (1994) Pattern matching in a digitized image. Algorithmica 12(3\/4):375\u2013408","journal-title":"Algorithmica"},{"key":"444_CR20358","doi-asserted-by":"crossref","unstructured":"Vishkin U (1985) Optimal parallel pattern matching in strings. In: Proceedings of the 12th ICALP, pp 91\u2013113","DOI":"10.1016\/S0019-9958(85)80028-0"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:52:37Z","timestamp":1792108357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_444","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}