{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:58Z","timestamp":1725483718037},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_5","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"59-75","source":"Crossref","is-referenced-by-count":7,"title":["An Index for Two Dimensional String Matching Allowing Rotations"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Fredriksson","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 59\u201368, Victoria, B.C., Canada, May1992. ACM Press.","DOI":"10.1145\/129712.129719"},{"key":"5_CR2","unstructured":"A. Amir. Multidimensional pattern matching: A survey. Technical Report GIT-CC-92\/29, Georgia Institute of Technology, College of Computing, 1992."},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0030785","volume-title":"Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM\u201998)","author":"K. Fredriksson","year":"1998","unstructured":"K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM\u201998), LNCS 1448, pages 118\u2013125, 1998."},{"key":"5_CR4","unstructured":"K. Fredriksson and E. Ukkonen. Algorithms for 2-d hamming distance under rotations. Manuscript, 1999."},{"issue":"11\u201313","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/S0167-8655(99)00092-6","volume":"20","author":"K. Fredriksson","year":"1999","unstructured":"K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognition Letters, 20(11\u201313):1249\u20131258, 1999.","journal-title":"Pattern Recognition Letters"},{"key":"5_CR6","unstructured":"K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays. Submitted, 2000."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Z. Galil and K. Park. Truly alphabet-independent two-dimensional pattern matching. In IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 247\u2013257, Pittsburgh, PN, October1992. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1992.267767"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1137\/S0097539792231982","volume":"24","author":"R. Giancarlo","year":"1995","unstructured":"R. Giancarlo. A generalization of suffix trees to square matrices, with applications. SIAM J. on Computing, 24:520\u2013562, 1995.","journal-title":"SIAM J. on Computing"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/inco.1996.0087","volume":"130","author":"R. Giancarlo","year":"1996","unstructured":"R. Giancarlo and R. Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation, 130:151\u2013182, 1996.","journal-title":"Information and Computation"},{"key":"5_CR10","unstructured":"G. H. Gonnet. Efficient searching of text and pictures. Report OED-88-02, University of Waterloo, 1988."},{"key":"5_CR11","unstructured":"J. K\u00e4rkk\u00e4inen and E. Ukkonen. Two and higher dimensional pattern matching in optimal expected time. In Daniel D. Sleator, editor, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 715\u2013723, Arlington, VA, January 1994. ACM Press."},{"issue":"4\/5","key":"5_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01185433","volume":"12","author":"G. M. Landau","year":"1994","unstructured":"G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(4\/5):375\u2013408, October 1994.","journal-title":"Algorithmica"},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-48452-3_18","volume-title":"Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM\u201999)","author":"G. Navarro","year":"1999","unstructured":"G. Navarro and R. Baeza-Yates. Fast multi-dimensional approximate string matching. In Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM\u201999), LNCS, pages 243\u2013257, 1999."},{"key":"5_CR14","unstructured":"T. Takaoka. Approximate pattern matching with grey scale values. In Michael E. Houle and Peter Eades, editors, Proceedings of Conference on Computing: The Australian Theory Symposium, pages 196\u2013203, Townsville, January 29-30 1996. Australian Computer Science Communications."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"J. Tarhio. A sublinear algorithm for two-dimensional string matching. PRL: Pattern Recognition Letters, 17, 1996.","DOI":"10.1016\/0167-8655(96)00055-4"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0031-3203(95)00069-0","volume":"29","author":"J. Wood","year":"1996","unstructured":"J. Wood. Invariant pattern recognition: a review. Pattern Recognition, 29(1):1\u201317, 1996.","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:03Z","timestamp":1556376063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}