{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T07:26:12Z","timestamp":1790925972315,"version":"4.1.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T00:00:00Z","timestamp":1190332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s00453-007-9021-x","type":"journal-article","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T18:15:28Z","timestamp":1190312128000},"page":"314-336","source":"Crossref","is-referenced-by-count":16,"title":["Real Two Dimensional Scaled Matching"],"prefix":"10.1007","volume":"53","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","published-online":{"date-parts":[[2007,9,21]]},"reference":[{"key":"9021_CR1","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 96), pp.\u00a0320\u2013334 (1996)","DOI":"10.1007\/3-540-61258-0_23"},{"key":"9021_CR2","doi-asserted-by":"crossref","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. Inf. Process. Lett. 44, 233\u2013239 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9021_CR3","doi-asserted-by":"crossref","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. Inf. Comput. 118(1), 1\u201311 (1995)","journal-title":"Inf. Comput."},{"key":"9021_CR4","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 81, 97\u2013115 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9021_CR5","doi-asserted-by":"crossref","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. J.\u00a0Algorithms 13(1), 2\u201332 (1992)","journal-title":"J.\u00a0Algorithms"},{"issue":"4","key":"9021_CR6","doi-asserted-by":"crossref","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. Inf. Process. Lett. 70(4), 185\u2013190 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9021_CR7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0022-0000(05)80002-9","volume":"48","author":"O. Berkman","year":"1994","unstructured":"Berkman, O., Vishkin, U.: Finding level-ancestors in trees. J.\u00a0Comput. Syst. Sci. 48(2), 214\u2013229 (1994)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9021_CR8","doi-asserted-by":"crossref","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. Commun. ACM 20, 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"9021_CR9","first-page":"173","volume":"314","author":"M. Crochemore","year":"2004","unstructured":"Crochemore, M., Landau, G.M., Amir, A., Butman, A., Schapps, M.: Two dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1\u20132), 173\u2013187 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9021_CR10","first-page":"987","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishan, S.: On the sorting-complexity of suffix tree construction. J.\u00a0ACM 47(6), 987\u20131011 (2000)","journal-title":"J.\u00a0ACM"},{"key":"9021_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BFb0030785","volume-title":"Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM\u00a098)","author":"K. Fredriksson","year":"1998","unstructured":"Fredriksson, K., Ukkonen, E.: A rotation invariant filter for two-dimensional string matching. In: Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM\u00a098). Lecture Notes in Computer Science, vol.\u00a01448, pp.\u00a0118\u2013125. Springer, New York (1998)"},{"issue":"2","key":"9021_CR12","doi-asserted-by":"crossref","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. Inf. Comput. 130(2), 151\u2013182 (1996)","journal-title":"Inf. Comput."},{"key":"9021_CR13","first-page":"338","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. Comput. Syst. Sci. 13, 338\u2013355 (1984)","journal-title":"Comput. Syst. Sci."},{"key":"9021_CR14","doi-asserted-by":"crossref","unstructured":"Idury, R.M., Sch\u00e4ffer, A.A.: Multiple matching of rectangular patterns. In: Proc. 25th ACM STOC, pp.\u00a081\u201389 (1993)","DOI":"10.1145\/167088.167116"},{"key":"9021_CR15","doi-asserted-by":"crossref","unstructured":"Karkkainen, J., Sanders, P.: Simple linear work suffix array construction. In: ICALP, pp.\u00a0943\u2013955 (2003)","DOI":"10.1007\/3-540-45061-0_73"},{"key":"9021_CR16","doi-asserted-by":"crossref","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. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"9021_CR17","doi-asserted-by":"crossref","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. Inf. Sci. 13, 169\u2013184 (1987)","journal-title":"Inf. Sci."},{"issue":"3\/4","key":"9021_CR18","doi-asserted-by":"crossref","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 12(3\/4), 375\u2013408 (1994)","journal-title":"Algorithmica"},{"issue":"5","key":"9021_CR19","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J.\u00a0Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9021_CR20","first-page":"262","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J.\u00a0ACM 23, 262\u2013272 (1976)","journal-title":"J.\u00a0ACM"},{"key":"9021_CR21","unstructured":"Pentland, A.: Invited talk. NSF Institutional Infrastructure Workshop, 1992"},{"key":"9021_CR22","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J.\u00a0Comput. 17, 1253\u20131262 (1988)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9021_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"9021_CR24","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. 14 IEEE Symposium on Switching and Automata Theory, pp.\u00a01\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9021-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9021-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9021-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:59Z","timestamp":1559137499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9021-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,21]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9021"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9021-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,21]]}}}