{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:29:30Z","timestamp":1742934570627,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_247","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"559-562","source":"Crossref","is-referenced-by-count":0,"title":["Multidimensional String Matching"],"prefix":"10.1007","author":[{"given":"Juha","family":"K\u00e4rkk\u00e4inen","sequence":"first","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"247_CR1_247","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1142\/S0129054105003662","volume":"16","author":"A. Amir","year":"2005","unstructured":"Amir, A.: Theoretical issues of searching aerial photographs: a\u00a0bird's eye view. Int. J. Found. Comput. Sci. 16, 1075\u20131097 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"247_CR2_247","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. Comput. 23, 313\u2013323 (1994)","journal-title":"SIAM J. Comput."},{"key":"247_CR3_247","first-page":"200","volume-title":"Proc. 17th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol. 4009","author":"A. Amir","year":"2006","unstructured":"Amir, A., Chencinski, E.: Faster two dimensional scaled matching. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol.\u00a04009, pp. 200\u2013210. Springer, Berlin (2006)"},{"key":"247_CR4_247","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-27801-6_31","volume-title":"Proc. 15th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol. 3109","author":"A. Amir","year":"2004","unstructured":"Amir, A., Kapah, O., Tsur, D.: Faster two dimensional pattern matching with rotations. In: Proc. 15th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol.\u00a03109, pp. 409\u2013419. Springer, Berlin (2004)"},{"key":"247_CR5_247","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.M.: Fast parallel and serial multidimensional approximate array matching. Theoretical Comput. Sci. 81, 97\u2013115 (1991)","journal-title":"Theoretical Comput. Sci."},{"key":"247_CR6_247","first-page":"21","volume":"1","author":"R. Baeza-Yates","year":"2000","unstructured":"Baeza-Yates, R., Navarro, G.: New models and algorithms for multidimensional approximate pattern matching. J.\u00a0Discret. Algorithms 1, 21\u201349 (2000)","journal-title":"J. Discret. Algorithms"},{"key":"247_CR7_247","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0207043","volume":"7","author":"T.P. Baker","year":"1978","unstructured":"Baker, T.P.: A\u00a0technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7, 533\u2013541 (1978)","journal-title":"SIAM J. Comput."},{"key":"247_CR8_247","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"R.S. Bird","year":"1977","unstructured":"Bird, R.S.: Two dimensional pattern matching. Inf. Process. Lett. 6, 168\u2013170 (1977)","journal-title":"Inf. Process. Lett."},{"key":"247_CR9_247","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/146370.146374","volume":"24","author":"L.G. Brown","year":"1992","unstructured":"Brown, L.G.: A\u00a0survey of image registration techniques. ACM Computing Surveys 24, 325\u2013376 (1992)","journal-title":"ACM Computing Surveys"},{"key":"247_CR10_247","first-page":"75","volume-title":"Recent Research Developments in Pattern Recognition, vol. II","author":"K. Fredriksson","year":"2002","unstructured":"Fredriksson, K., Navarro, G., Ukkonen, E.: Faster than FFT: Rotation invariant combinatorial template matching. In: Pandalai, S. (ed.) Recent Research Developments in Pattern Recognition, vol. II, pp. 75\u2013112. Transworld Research Network, Trivandrum, India (2002)"},{"key":"247_CR11_247","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.tcs.2005.06.029","volume":"347","author":"K. Fredriksson","year":"2005","unstructured":"Fredriksson, K., Navarro, G., Ukkonen, E.: Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Theoretical Comput. Sci. 347, 239\u2013275 (2005)","journal-title":"Theoretical Comput. Sci."},{"key":"247_CR12_247","first-page":"96","volume-title":"Proc. 7th International Symposium on String Processing and Information Retrieval","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 International Symposium on String Processing and Information Retrieval, pp. 96\u2013104. IEEE Computer Society, Washington, DC (2000)"},{"key":"247_CR13_247","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1137\/S0895480101390308","volume":"18","author":"Z. Galil","year":"2004","unstructured":"Galil, Z., Park, J.G., Park, K.: Three-dimensional periodicity and its application to pattern matching. SIAM J. Discret. Math. 18, 362\u2013381 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"247_CR14_247","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1137\/S0097539792241941","volume":"25","author":"Z. Galil","year":"1996","unstructured":"Galil, Z., Park, K.: Alphabet-independent two-dimensional witness computation. SIAM J. Comput. 25, 907\u2013935 (1996)","journal-title":"SIAM J. Comput."},{"key":"247_CR15_247","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/S0097539794275872","volume":"29","author":"J. K\u00e4rkk\u00e4inen","year":"1999","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Two- and higher-dimensional pattern matching in optimal expected time. SIAM J. Comput. 29, 571\u2013589 (1999)","journal-title":"SIAM J. Comput."},{"key":"247_CR16_247","first-page":"463","volume-title":"Proc. 26th International Colloquium on Automata Languages and Programming. LNCS, vol. 1644","author":"D.K. Kim","year":"1999","unstructured":"Kim, D.K., Park, K.: Linear-time construction of two-dimensional suffix trees. In: Proc. 26th International Colloquium on Automata Languages and Programming. LNCS, vol.\u00a01644, pp. 463\u2013472. Springer, Berlin (1999)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:16:24Z","timestamp":1662174984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_247"}},"subtitle":["1999; K\u00e4rkk\u00e4inen, Ukkonen"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_247","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}