{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:04Z","timestamp":1725559144795},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_59","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"681-692","source":"Crossref","is-referenced-by-count":15,"title":["Advantages of Backward Searching \u2014 Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Veli","family":"M\u00e4kinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph. In: Dokl. Acad. Nauk. SSSR 194, pp. 487\u2013488 (1970) (in Russian); English translation in Soviet Math. Dokl. 11, 1209\u20131210, (1975)."},{"key":"59_CR2","unstructured":"Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo (1996)"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. FOCS 2000, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"59_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-30213-1_23","volume-title":"String Processing and Information Retrieval","author":"P. Ferragina","year":"2004","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: An alphabet-friendly FM-index. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 150\u2013160. Springer, Heidelberg (2004)"},{"key":"59_CR5","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. SODA 2003, pp. 841\u2013850 (2003)"},{"key":"59_CR6","unstructured":"Grossi, R., Gupta, A., Vitter, J.: When indexing equals compression: Experiments with compressing suffix arrays and applications. In: Proc. SODA 2004, pp. 636\u2013645 (2004)"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. STOC 2000, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"59_CR8","unstructured":"Jacobson, G.: Succinct Static Data Structures. PhD thesis, CMU-CS-89-112, Carnegie Mellon University (1989)"},{"key":"59_CR9","unstructured":"K\u00e4rkk\u00e4inen, J.: Repetition-Based Text Indexes, PhD Thesis, Report A-1999-4, Department of Computer Science, University of Helsinki, Finland (1999)"},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022, 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"59_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An Analysis of the Burrows-Wheeler Transform. J. of the ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"J. of the ACM"},{"key":"59_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space economical suffix tree construction algorithm. J. of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. of the ACM"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Munro, I.: Tables. In: Proc. FSTTCS 1996, pp. 37\u201342 (1996)","DOI":"10.1007\/3-540-62034-6_35"},{"issue":"1-2","key":"59_CR14","first-page":"191","volume":"56","author":"V. M\u00e4kinen","year":"2003","unstructured":"M\u00e4kinen, V.: Compact Suffix Array \u2014 A space-efficient full-text index. Fundamenta Informaticae\u00a056(1-2), 191\u2013210 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"59_CR15","unstructured":"M\u00e4kinen, V., Navarro, G.: New search algorithms and space\/time tradeoffs for succinct suffix arrays. Technical report, C-2004-20, Dept. CS, Univ. Helsinki, (April 2004), \n                  \n                    http:\/\/www.cs.helsinki.fi\/u\/vmakinen\/papers\/ssa_tech_2004.ps.gz"},{"key":"59_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-540-27801-6_32","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2004","unstructured":"M\u00e4kinen, V., Navarro, G.: Compressed compact suffix arrays. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 420\u2013433. Springer, Heidelberg (2004)"},{"key":"59_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-39984-1_24","volume-title":"String Processing and Information Retrieval","author":"M. Mar\u00edn","year":"2003","unstructured":"Mar\u00edn, M., Navarro, G.: Distributed query processing using suffix arrays. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 311\u2013325. Springer, Heidelberg (2003)"},{"issue":"1","key":"59_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S1570-8667(03)00066-2","volume":"2","author":"G. Navarro","year":"2004","unstructured":"Navarro, G.: Indexing text using the Ziv-Lempel trie. J. of Discrete Algorithms\u00a02(1), 87\u2013114 (2004)","journal-title":"J. of Discrete Algorithms"},{"key":"59_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-40996-3_35","volume-title":"Algorithms and Computation","author":"K. Sadakane","year":"2000","unstructured":"Sadakane, K.: Compressed text databases with efficient query algorithms based on the compressed suffix array. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 410\u2013421. Springer, Heidelberg (2000)"},{"key":"59_CR20","first-page":"225","volume-title":"Proc. SODA 2002","author":"K. Sadakane","year":"2002","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. SODA 2002, pp. 225\u2013232. ACM-SIAM, New York (2002)"},{"key":"59_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-24587-2_26","volume-title":"Algorithms and Computation","author":"K. Sadakane","year":"2003","unstructured":"Sadakane, K.: Constructing compressed suffix arrays with large alphabets. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 240\u2013249. Springer, Heidelberg (2003)"},{"issue":"6","key":"59_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0020-0190(01)00298-8","volume":"82","author":"S. Srinivasa Rao","year":"2002","unstructured":"Srinivasa Rao, S.: Time-space trade-offs for compressed suffix arrays. Inf. Proc. Lett., 82(6), 307-311 (2002)","journal-title":"Inf. Proc. Lett."},{"key":"59_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix-trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"59_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"Valiant, L.: A bridging model for parallel computation. Comm. ACM\u00a033, 103\u2013111 (1990)","journal-title":"Comm. ACM"},{"key":"59_CR25","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. IEEE 14th Ann. Symp. on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"59_CR26","volume-title":"Managing Gigabytes","author":"I. Witten","year":"1999","unstructured":"Witten, I., Moffat, A., Bell, T.: Managing Gigabytes, 2nd edn. Morgan Kaufmann Publishers, New York (1999)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:40Z","timestamp":1620012580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}