{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:52Z","timestamp":1725664192715},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600848"},{"type":"electronic","value":"9783540494256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:37:51Z","timestamp":1330259871000},"page":"111-122","source":"Crossref","is-referenced-by-count":3,"title":["On the construction of classes of suffix trees for square matrices: Algorithms and applications"],"prefix":"10.1007","author":[{"given":"Raffaele","family":"Giancarlo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"10_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA., 1974."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347\u2013365, 1988.","journal-title":"Algorithmica"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indices. Acta Informatica, 1:173\u2013189, 1972.","journal-title":"Acta Informatica"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"R. Giancarlo. An index data structure for matrices, with applications to fast two-dimensional pattern matching. In Proc. of Workshop on Algorithms and Data Structures, LNCS-Springer-Verlag, pages 337\u2013348, 1993.","DOI":"10.1007\/3-540-57155-8_260"},{"key":"10_CR5","unstructured":"R. Giancarlo. The suffix tree of a square matrix, with applications. In Proc. Fourth Symposium on Discrete Algorithms, pages 402\u2013411. ACM-SIAM, 1993. To appear in SIAM J. on Computing, 1995."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Giancarlo and R. Grossi. Parallel construction and query of suffix trees for two-dimensional matrices. In Proc. of the 5-th ACM Symposium on Parallel Algorithms and Architectures, pages 86\u201397, 1993.","DOI":"10.1145\/165231.165243"},{"key":"10_CR7","unstructured":"R. Giancarlo and R. Grossi. On the construction of classes of index data structure for square matrices: algorithms and applications. AT&T Bell Labs. Technical Memorandum 11272-940110-03, 1994."},{"key":"10_CR8","unstructured":"G.H. Gonnet. Efficient searching of text and pictures-Extended Abstract. Technical report, University Of Waterloo-OED-88-02, 1988."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Symposium on Foundations of Computer Science, pages 8\u201321. IEEE, 1978.","DOI":"10.1109\/SFCS.1978.3"},{"key":"10_CR10","unstructured":"R. Jain. Workshop report on visual information systems. Technical report, National Science Foundation, 1992."},{"key":"10_CR11","unstructured":"P. Johansen. Combinatorial pattern recognition, the method and the program package. Technical report, DIKU 94\/10, 1994."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"R.M. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. In Proc. 4th Symposium on Theory of Computing, pages 125\u2013136. ACM, 1972.","DOI":"10.1145\/800152.804905"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"5","author":"U. Manber","year":"1993","unstructured":"U. Manber and E. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 22, 5 (1993), 935\u2013948.","journal-title":"SIAM Journal of Computing 22"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1111\/j.1538-4632.1990.tb00201.x","volume":"22","author":"D.M. Mark","year":"1990","unstructured":"D.M. Mark. Neighbor-based properties of some orderings of two-dimensional space. Geographical Analysis, 22:145\u2013157, 1990.","journal-title":"Geographical Analysis"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight. A space economical suffix tree construction algorithm. J. of ACM, 23:262\u2013272, 1976.","journal-title":"J. of ACM"},{"key":"10_CR16","unstructured":"A. Rosenfeld and A.C. Kak. Digital Picture Processing. Academic Press, 1982."},{"key":"10_CR17","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, NY, 1990."},{"key":"10_CR18","unstructured":"J.A. Storer. Two dimensional suffix tries and their use in lossless sliding window image compression. In Proc. 6th Symposium on Combinatorial Pattern Matching. To appear, LNCS, 1995."},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1137\/0222070","volume":"22","author":"W. Szpankowski","year":"1993","unstructured":"W. Szpankowski. A generalized suffix tree and its (un)expected asymptotic behaviour. SIAM J. on Computing, 22:1176\u20131198, 1993.","journal-title":"SIAM J. on Computing"},{"key":"10_CR20","unstructured":"W. Szpankowski. Private communication."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:31:22Z","timestamp":1619559082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}