{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:12Z","timestamp":1775282292126,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540734369","type":"print"},{"value":"9783540734376","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_11","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"83-94","source":"Crossref","is-referenced-by-count":10,"title":["A Lempel-Ziv Text Index on Secondary Storage"],"prefix":"10.1007","author":[{"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"NATO ISI Series","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85\u201396. Springer, Heidelberg (1985)"},{"issue":"13","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requeriments of suffix trees. Softw. Pract. Exper.\u00a029(13), 1149\u20131171 (1999)","journal-title":"Softw. Pract. Exper."},{"issue":"3","key":"11_CR3","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. JACM\u00a048(3), 407\u2013430 (2001)","journal-title":"JACM"},{"key":"11_CR4","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys (to appear)"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"54","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed texts. JACM\u00a054(4), 552\u2013581 (2005)","journal-title":"JACM"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Moura","year":"2000","unstructured":"Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM TOIS\u00a018(2), 113\u2013139 (2000)","journal-title":"ACM TOIS"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The String B-tree: a new data structure for string search in external memory and its applications. JACM\u00a046(2), 236\u2013280 (1999)","journal-title":"JACM"},{"key":"11_CR8","unstructured":"Ferragina, P., Grossi, R.: Fast string searching in secondary storage: theoretical developments and experimental results. In: Proc. SODA, pp. 373\u2013382 (1996)"},{"key":"11_CR9","unstructured":"Clark, D., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. SODA, pp. 383\u2013391 (1996)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Navarro, G., Sadakane, K.: Advantages of backward searching \u2014 efficient secondary memory and distributed implementation of compressed suffix arrays. In: Proc. ISAAC, pp. 681\u2013692 (2004)","DOI":"10.1007\/978-3-540-30551-4_59"},{"key":"11_CR11","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. SODA, pp. 225\u2013232 (2002)"},{"issue":"1","key":"11_CR12","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"},{"issue":"5","key":"11_CR13","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE TIT\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE TIT"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1137\/S0097539797331105","volume":"29","author":"R. Kosaraju","year":"1999","unstructured":"Kosaraju, R., Manzini, G.: Compression of low entropy strings with Lempel-Ziv algorithms. SIAM J.Comp.\u00a029(3), 893\u2013911 (1999)","journal-title":"SIAM J.Comp."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Navarro, G., Sadakane, K.: Reducing the space requirement of LZ-index. In: Proc. CPM, pp. 319\u2013330 (2006)","DOI":"10.1007\/11780441_29"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Navarro, G.: Space-efficient construction of LZ-index. In: Proc. ISAAC pp. 1143\u20131152 (2005)","DOI":"10.1007\/11602613_113"},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"I. Munro","year":"2001","unstructured":"Munro, I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J.Comp.\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM J.Comp."},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"I. Munro","year":"1996","unstructured":"Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"key":"11_CR19","unstructured":"Arroyuelo, D., Navarro, G.: A Lempel-Ziv text index on secondary storage. Technical Report TR\/DCC-2004, -4, Dept. of Computer Science, Universidad de Chile (2007), ftp:\/\/ftp.dcc.uchile.cl\/pub\/users\/gnavarro\/lzidisk.ps.gz"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: Patricia \u2013 practical algorithm to retrieve information coded in alphanumeric. JACM\u00a015(4), 514\u2013534 (1968)","journal-title":"JACM"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Harman, D.: Overview of the third text REtrieval conference. In: Proc. Third Text REtrieval Conference (TREC-3), NIST Special Publication, pp. 500\u2013207 (1995)","DOI":"10.6028\/NIST.SP.500-225"},{"issue":"6","key":"11_CR22","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0306-4379(96)00025-7","volume":"21","author":"R. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R., Barbosa, E.F., Ziviani, N.: Hierarchies of indices for text searching. Inf. Systems\u00a021(6), 497\u2013514 (1996)","journal-title":"Inf. Systems"},{"issue":"5","key":"11_CR23","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. Comp.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comp."},{"key":"11_CR24","unstructured":"Gonz\u00e1lez, R., Navarro, G.: Compressed text indexes with fast locate. In: Proc. of CPM\u201907. LNCS (to appear, 2007)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:02Z","timestamp":1619518322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}