Reducing the space requirement of LZ-index

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4009 LNCS, Issue , 2006, Pages 318-329

  Arroyuelo, Diego ^a   Navarro, Gonzalo ^a   Sadakane, Kunihiko ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA COMPRESSION; DATA STRUCTURES; TEXT PROCESSING;

LZ-INDEX; SEARCH TIME; SPACE COMPLEXITY;

INDEXING (OF INFORMATION);

EID: 33746086717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_29     Document Type: Conference Paper

References (18)

1. D. Benoit, E. Demaine, I. Munro, R. Raman, V. Ramari, and S.S. Rao. Representing trees of higher degree. Algorithmica, 43(4):275-292, 2005.
2. B. Chazelle, A functional approach to data structures and its use in multidimensional searching. SIAM J. on Computing, 17(3):427-462, 1988.
3. P. Ferragina, F. Luccio, G. Manzini, and S, Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond. Proc. FOCS, pp. 184-196, 2005.
4. P. Ferragina and G. Manzini, Indexing compressed texts. J. of the ACM 54(4) 1552-581, 2005.
5. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. An alphabet-friendly FM-index. Proc. SPIRE, LNCS 3246, pp. 150-160, 2004, Extended version to appear in ACM TALG.
6. R. Geary, R. Ramaii, and V. Raman. Succinct ordinal trees with level-ancestor queries. Proc. SODA, pp. 1-10, 2004.
7. R. Grossi, A. Gupta, and J. S. Vitter, High-order entropy-compressed text indexes. Proc. SODA, pp. 841-850, 2003.
8. R. Kosaraju and G. Manzini. Compression of low entropy strings with Lempel-Ziv algorithms. SIAM J. on Computing, 29(3):893-911, 1999.
9. G, Manzini. An analysis of the Burrows-Wheeler transform. J. of the ACM 48(3):407-430, 2001.
10. D, R. Morrison, Patricia - practical algorithm to retrieve information coded in alphanumeric. J. of the ACM 15(4):514-534, 1968.
11. I. Munro. Tables. Proc. FSTTCS, LNCS 1180, pp. 37-42, 1996.
12. I. Munro, R, Raman, V, Raman, and S.S. Rao. Succinct representations of permutations, Proc. ICALP, LNCS 2719, pp. 345-356, 2003.
13. J. I. Munro and V. Raman, Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. on Computing, 31(3):762-776, 2001.
14. G. Navarro, Indexing text using the Ziv-Lempel trie, Journal of Discrete Algorithms (JDA), 2(1):87-114, 2004, See also TR/DCC-2003-0, Dept. of CS, U. Chile, ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/jlzindex.ps.gz.
15. R, Raman, V. Raman, and S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, Proc. SODA, pp. 233-242, 2002.
16. K. Sadakane. New Text Indexing Functionalities of the Compressed Suffix Arrays, J., of Algorithms, 48(2):294-313, 2003
17. K. Sadakane and R. Grossi. Squeezing Succinct Data Structures into Entropy Bounds. Proc. SODA, pp. 1230-1239, 2006.
18. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. Information Theory, 24(5):530-536, 1978.