{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:37Z","timestamp":1725577417465},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_32","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"300-309","source":"Crossref","is-referenced-by-count":0,"title":["A Note on a Tree-Based 2D Indexing"],"prefix":"10.1007","author":[{"given":"Jan","family":"\u017dd\u2019\u00e1rek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo\u0159ivoj","family":"Melichar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","first-page":"216","volume-title":"Handbook of Formal Languages","author":"D. Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of Formal Languages, vol.\u00a0III, pp. 216\u2013267. Springer, Heidelberg (1997)"},{"key":"32_CR2","first-page":"293","volume-title":"Pattern Matching Algorithms","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, pp. 293\u2013340. Oxford University Press, Oxford (1997)"},{"key":"32_CR3","unstructured":"Gonnet, G.H.: Efficient searching of text and pictures. Report OED-88-02, University of Waterloo (1988)"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1137\/S0097539792231982","volume":"24","author":"R. Giancarlo","year":"1995","unstructured":"Giancarlo, R.: A generalization of the suffix tree to square matrices, with applications. SIAM J. Comput.\u00a024(3), 520\u2013562 (1995)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"32_CR5","doi-asserted-by":"publisher","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.\u00a044(5), 233\u2013239 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1-3","key":"32_CR6","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, Y.A., Park, K.: Generalizations of suffix arrays to multi-dimensional matrices. Theor. Comput. Sci.\u00a0302(1-3), 401\u2013416 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-007-0063-x","volume":"48","author":"J.C. Na","year":"2007","unstructured":"Na, J.C., Giancarlo, R., Park, K.: On-line construction of two-dimensional suffix tree in \n                  \n                    \n                  \n                  $\\mathcal{O}(n^2 \\log n)$\n                 time. Algorithmica\u00a048, 173\u2013186 (2007)","journal-title":"Algorithmica"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0030786","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"1998","unstructured":"Kim, D.K., Kim, Y.A., Park, K.: Constructing suffix arrays for multi-dimensional matrices. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 126\u2013139. Springer, Heidelberg (1998)"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","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.\u00a0130(2), 151\u2013182 (1996)","journal-title":"Inf. Comput."},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-57155-8_260","volume-title":"Algorithms and Data Structures","author":"R. Giancarlo","year":"1993","unstructured":"Giancarlo, R.: An index data structure for matrices, with applications to fast two-dimensional pattern matching. In: Dehne, F., et al. (eds.) WADS 1993. LNCS, vol.\u00a0709, pp. 337\u2013348. Springer, Heidelberg (1993)"},{"issue":"2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.1996.0844","volume":"24","author":"R. Giancarlo","year":"1997","unstructured":"Giancarlo, R., Grossi, R.: Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms. J. Algorithms\u00a024(2), 223\u2013265 (1997)","journal-title":"J. Algorithms"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1977","unstructured":"Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci.\u00a013(2), 95\u2013121 (1977)","journal-title":"Inf. Sci."},{"key":"32_CR13","unstructured":"Janou\u0161ek, J.: String suffix automata and subtree pushdown automata. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) Proc. PSC 2009, CTU in Prague, Czech Republic, pp. 160\u2013172 (2009)"},{"key":"32_CR14","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007), \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata\n                  \n                  \n                 (release October 12, 2007)"},{"key":"32_CR15","unstructured":"Cleophas, L.: Tree Algorithms. Two Taxonomies and a Toolkit. PhD thesis, Technische Universiteit Eindhoven, Eindhoven (2008)"},{"key":"32_CR16","first-page":"659","volume-title":"Proc. IMCSIT","author":"T. Flouri","year":"2009","unstructured":"Flouri, T., Janou\u0161ek, J., Melichar, B.: Tree pattern matching by deterministic pushdown automata. In: Ganzha, M., Paprzycki, M. (eds.) Proc. IMCSIT, vol.\u00a04, pp. 659\u2013666. IEEE Computer Society Press, Los Alamitos (2009)"},{"key":"32_CR17","unstructured":"Olsen, G.: \u201cNewick\u2019s 8:45\u201d tree format standard (August 1990), \n                  \n                    http:\/\/evolution.genetics.washington.edu\/phylip\/newick_doc.html"},{"key":"32_CR18","volume-title":"Computational Complexity","author":"K. Wagner","year":"2001","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Springer, Heidelberg (2001)"},{"key":"32_CR19","unstructured":"\u017dd\u2019\u00e1rek, J.: Two-dimensional Pattern Matching Using Automata Approach. PhD thesis, Czech Technical University in Prague (2010), \n                  \n                    http:\/\/www.stringology.org\/papers\/Zdarek-PhD_thesis-2010.pdf"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:46:33Z","timestamp":1553395593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}