LZ77-like compression with fast random access

Data Compression Conference Proceedings

Volumn , Issue , 2010, Pages 239-248

  Kreft, Sebastian ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

END FORCE; INDEXING SCHEME; INDIVIDUAL SEQUENCES; OPTIMAL TIME; RANDOM ACCESS; SEQUENCE DATABASE; TEXT PARSING;

DATA COMPRESSION;

EID: 77952730117     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2010.29     Document Type: Conference Paper

References (19)

1. M. Banikazemi. LZB: Data compression with bounded references. In Proc. DCC, page 436, 2009. Poster.
2. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
3. G. Chen, S. Puglisi, and W. Smyth. Lempel-Ziv factorization using less time & space. Mathematics in Computer Science, 1(4):605-623, June 2008.
4. F. Claude and G. Navarro. Self-indexed text compression using straight-line programs. In Proc. 34th MFCS, pages 235-246, 2009.
5. P. Ferragina and G. Manzini. Indexing compressed texts. JACM, 52(4):552-581, 2005.
6. E. Fiala and D. Greene. Data compression with finite windows. CACM, 32(4):490-505, 1989.
7. J. Fischer and V. Heun. A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. In Proc. 1st ESCAPE, pages 459-470, 2007.
8. F. Franek, R. Simpson, and W. Smyth. The maximum number of runs in a string. In Proc. AWOCA, pages 26-35, 2003.
9. R. Kosaraju and G. Manzini. Compression of low entropy strings with Lempel-Ziv algorithms. SIAM J. Comp., 29(3):893-911, 1999.
10. J. Larsson and A. Moffat. Off-line dictionary-based compression. Proc. IEEE, 88(11):1722-1732,2000.
11. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM J. Comp., 22(5):935-948, 1993.
12. J. Munro, R. Raman, V. Raman, and S. S. Rao. Succinct representations of permutations. In Proc. 30th ICALP, pages 345-356, 2003.
13. G. Navarro. Indexing LZ77: The next step in self-indexing. Keynote talk at the Third Workshop on Compression, Text, and Algorithms, Melbourne, Australia, 2008.
14. G. Navarro. Implementing the LZ-index: Theory versus practice. ACM JEA, 13(2), 2009.
15. G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM CSUR, 39(1):article 2, 2007.
16. R. Raman, V. Raman, and S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th SODA, pages 233-242, 2002.
17. J. Sirén, N. Välimäki, V. Mäkinen, and G. Navarro. Run-length compressed indexes are superior for highly repetitive sequence collections. In Proc. 15th SPIRE, pages 164-175, 2008.
18. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE TIT, 23(3):337-343, 1977.
19. N. Ziviani, E. Moura, G. Navarro, and R. Baeza-Yates. Compression: A key for next-generation text retrieval systems. IEEE Computer, 33(11):37-44, 2000.