{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:25:13Z","timestamp":1794378313596,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405450","type":"print"},{"value":"9783540450788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_31","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"353-364","source":"Crossref","is-referenced-by-count":11,"title":["Real Two Dimensional Scaled Matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayelet","family":"Butman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","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_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Calinescu, G.: Alphabet independent and dictionary scaled matching. In: Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 1996), pp. 320\u2013334 (1996)","DOI":"10.1007\/3-540-61258-0_23"},{"key":"31_CR3","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"},{"issue":"1","key":"31_CR4","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 half rectangular figures. Information and Computation\u00a0118(1), 1\u201311 (1995)","journal-title":"Information and Computation"},{"key":"31_CR5","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"},{"issue":"1","key":"31_CR6","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, G.M., Vishkin, U.: Efficient Pattern matching with scaling. Journal of Algorithms\u00a013(1), 2\u201332 (1992)","journal-title":"Journal of Algorithms"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM\u00a020, 762\u2013772 (1977)","journal-title":"Comm. ACM"},{"key":"31_CR8","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)"},{"issue":"2","key":"31_CR9","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_CR10","doi-asserted-by":"crossref","unstructured":"Idury, R.M., Sch\u00e4ffer, A.A.: Multiple matching of rectangular Patterns. In: Proc. 25th ACM STOC, pp. 81\u201389 (1993)","DOI":"10.1145\/167088.167116"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern matching in strings. SIAM J. Comp.\u00a06, 323\u2013350 (1977)","journal-title":"SIAM J. Comp."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0255(87)90037-5","volume":"13","author":"K. Krithivansan","year":"1987","unstructured":"Krithivansan, K., Sitalakshmi, R.: Efficient two dimensional Pattern matching in the presence of errors. Information Sciences\u00a013, 169\u2013184 (1987)","journal-title":"Information Sciences"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G.M. Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science\u00a043, 239\u2013249 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"3\/4","key":"31_CR14","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"},{"key":"31_CR15","unstructured":"Pentland, A.: Invited talk. NSF Institutional Infrastructure Workshop (1992)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:48:21Z","timestamp":1559195301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_31","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b11837","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}