{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:17:33Z","timestamp":1743063453817,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"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_442","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:39Z","timestamp":1214505459000},"page":"979-982","source":"Crossref","is-referenced-by-count":2,"title":["Two-Dimensional Pattern Indexing"],"prefix":"10.1007","author":[{"given":"Joong Chae","family":"Na","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Ferragina","sequence":"additional","affiliation":[]},{"given":"Raffaele","family":"Giancarlo","sequence":"additional","affiliation":[]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"442_CR1_442","doi-asserted-by":"crossref","unstructured":"Cole, R. Hariharan,\nR.: Faster suffix tree construction with missing suffix links. In: Proceedings of the 30th\nAnnual ACM Symposium on Theory of Computing, 2000,\npp.\u00a0407\u2013415","DOI":"10.1145\/335305.335352"},{"key":"442_CR2_442","doi-asserted-by":"crossref","unstructured":"Giancarlo, R.: An index data structure for matrices, with applications to fast\ntwo\u2010dimensional pattern matching. In: Proceedings of Workshop on Algorithm and Data Structures, vol. 709,\npp.\u00a0337\u2013348. Springer Lect. Notes Comp. Sci. Montr\u00e9al, Canada (1993)","DOI":"10.1007\/3-540-57155-8_260"},{"key":"442_CR3_442","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1137\/S0097539792231982","volume":"24","author":"R. Giancarlo","year":"1995","unstructured":"Giancarlo, R.:\nA\u00a0generalization of the suffix tree to square matrices, with application. SIAM\nJ.\u00a0Comput. 24, 520\u2013562\n(1995)","journal-title":"SIAM J. Comput."},{"key":"442_CR4_442","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/inco.1996.0087","volume":"130","author":"R. Giancarlo","year":"1996","unstructured":"Giancarlo, R.,\nGrossi, R.: On the construction of classes of suffix trees for square matrices: Algorithms and\napplications. Inf. Comput. 130, 151\u2013182\n(1996)","journal-title":"Inf. Comput."},{"key":"442_CR5_442","first-page":"293","volume-title":"Pattern Matching Algorithms, ch. 11,","author":"R. Giancarlo","year":"1997","unstructured":"Giancarlo, R., Grossi, R.: Suffix tree data structures for matrices. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms,\nch.\u00a011,, pp.\u00a0293\u2013340. Oxford University Press, Oxford (1997)"},{"key":"442_CR6_442","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1006\/jcom.1998.0495","volume":"15","author":"R. Giancarlo","year":"1999","unstructured":"Giancarlo, R.,\nGuaiana, D.: On-line construction of two\u2010dimensional suffix trees.\nJ.\u00a0Complex. 15, 72\u2013127\n(1999)","journal-title":"J. Complex."},{"key":"442_CR7_442","unstructured":"Gonnet, G.H.:\nEfficient searching of text and pictures. Tech. Report OED-88-02, University of Waterloo\n(1988)"},{"key":"442_CR8_442","doi-asserted-by":"crossref","unstructured":"Kim, D.K., Kim,\nY.A., Park, K.: Constructing suffix arrays for multi\u2010dimensional matrices. In:\nProceedings of the 9th Symposium on Combinatorial Pattern Matching, 1998,\npp.\u00a0249\u2013260","DOI":"10.1007\/BFb0030786"},{"key":"442_CR9_442","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0304-3975(02)00861-7","volume":"302","author":"D.K. Kim","year":"2003","unstructured":"Kim, D.K., Kim,\nY.A., Park, K.: Generalizations of suffix arrays to multi\u2010dimensional matrices.\nTheor. Comput. Sci. 302, 401\u2013416\n(2003)","journal-title":"Theor. Comput. Sci."},{"key":"442_CR10_442","doi-asserted-by":"crossref","unstructured":"Kim, D.K., Park,\nK.: Linear-time construction of two\u2010dimensional suffix trees. In: Proceedings of the\n26th International Colloquium on Automata, Languages, and Programming, 1999,\npp.\u00a0463\u2013372","DOI":"10.1007\/3-540-48523-6_43"},{"key":"442_CR11_442","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers,\nG.: Suffix arrays: A\u00a0new method for on-line string searches. SIAM\nJ.\u00a0Comput. 22, 935\u2013948\n(1993)","journal-title":"SIAM J. Comput."},{"key":"442_CR12_442","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.:\nA\u00a0space\u2010economical suffix tree construction algorithms. J.\u00a0ACM 23, 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"442_CR13_442","doi-asserted-by":"crossref","unstructured":"Na, J.C.,\nGiancarlo, R., Park, K.: $$ { O(n^2 \\log n) } $$ time\non-line construction of two\u2010dimensional suffix trees. In: Proceedings of the 11th\nInternational Computing and Combinatorics Conference, 2005,\npp.\u00a0273\u2013282","DOI":"10.1007\/11533719_29"},{"key":"442_CR14_442","unstructured":"Storer, J.A.:\nLossless image compression using generalized LZ1-type methods. In: Proceedings of Data\nCompression Conference, 1996, pp.\u00a0290\u2013299"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:53:52Z","timestamp":1662170032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_442"}},"subtitle":["2005; Na, Giancarlo, Park"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_442","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}