{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:25Z","timestamp":1725566905802},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_23","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"266-279","source":"Crossref","is-referenced-by-count":7,"title":["Two Dimensional Parameterized Matching"],"prefix":"10.1007","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[]},{"given":"Dekel","family":"Tsur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N. Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica\u00a016, 434\u2013449 (1996)","journal-title":"Algorithmica"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/3-540-45061-0_72","volume-title":"Automata, Languages and Programming","author":"A. Amir","year":"2003","unstructured":"Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: Algorithms, applications and a lower bound. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 929\u2013942. Springer, Heidelberg (2003)"},{"issue":"2","key":"23_CR3","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.: An alphabet independent approach to two dimensional pattern matching. SIAM J. on Computing\u00a023(2), 313\u2013323 (1994)","journal-title":"SIAM J. on Computing"},{"key":"23_CR4","unstructured":"Amir, A., Church, K.W., Dar, E.: Separable attributes: a technique for solving the submatrices character count problem. In: Proc. 13th Symposium on Discrete Algorithms (SODA), pp. 400\u2013401 (2002)"},{"key":"23_CR5","unstructured":"Amir, A., Cole, R.: Personal communications (2004)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters\u00a049, 111\u2013115 (1994)","journal-title":"Information Processing Letters"},{"key":"23_CR7","unstructured":"Apostolico, A., Erd\u00f6s, P., Lewenstein, M.: Parameterized matching with mismatches (manuscript)"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01215882","volume":"1","author":"G.P. Babu","year":"1995","unstructured":"Babu, G.P., Mehtre, B.M., Kankanhalli, M.S.: Color indexing for efficient image retrieval. Multimedia Tools and Applications\u00a01(4), 327\u2013348 (1995)","journal-title":"Multimedia Tools and Applications"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Baker, B.S.: A theory of parameterized pattern matching: algorithms and applications. In: Proc. 25th ACM Symposium on the Theory of Computation (STOC), pp. 71\u201380 (1993)","DOI":"10.1145\/167088.167115"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"B.S. Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized string pattern matching. J. Comput. Systems Sci.\u00a052(1), 28\u201342 (1996)","journal-title":"J. Comput. Systems Sci."},{"issue":"5","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1137\/S0097539793246707","volume":"26","author":"B.S. Baker","year":"1997","unstructured":"Baker, B.S.: Parameterized duplication in strings: Algorithms and an application to software maintenance. SIAM J. on Computing\u00a026(5), 1343\u20131362 (1997)","journal-title":"SIAM J. on Computing"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Faster suffix tree construction with missing suffix links. In: Proc. 32nd ACM Symposium on the Theory of Computation (STOC), pp. 407\u2013415 (2000)","DOI":"10.1145\/335305.335352"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th ACM Symposium on Theory of Computing (STOC), vol.\u00a067, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P. Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: Counting, reporting, and dynamization. J. of Algorithms\u00a019(2), 282\u2013317 (1995)","journal-title":"J. of Algorithms"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-30140-0_38","volume-title":"Algorithms \u2013 ESA 2004","author":"C. Hazay","year":"2004","unstructured":"Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 414\u2013425. Springer, Heidelberg (2004)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Faster algorithms for the construction of parameterized suffix trees. In: Proc. 36th Symposium on Foundation of Computer Science (FOCS), pp. 631\u2013637 (1995)","DOI":"10.1109\/SFCS.1995.492664"},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00130487","volume":"7","author":"M. Swain","year":"1991","unstructured":"Swain, M., Ballard, D.: Color indexing. International Journal of Computer Vision\u00a07(1), 11\u201332 (1991)","journal-title":"International Journal of Computer Vision"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0015775","volume-title":"Automata, Languages and Programming","author":"U. Vishkin","year":"1985","unstructured":"Vishkin, U.: Optimal parallel pattern matching in strings. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 91\u2013113. Springer, Heidelberg (1985)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/0220002","volume":"20","author":"U. Vishkin","year":"1991","unstructured":"Vishkin, U.: Deterministic sampling \u2014 a new technique for fast pattern matching. SIAM J. on Computing\u00a020, 303\u2013314 (1991)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:12Z","timestamp":1619505612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11496656_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}