The engineering of a compression boosting library: Theory vs practice in BWT compression

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

Volumn 4168 LNCS, Issue , 2006, Pages 756-767

  Ferragina, Paolo ^a   Giancarlo, Raffaele ^b   Manzini, Giovanni ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PALERMO   (Italy)

^c UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ENGINEERING; COMPUTER SCIENCE; DIGITAL LIBRARIES; ENCODING (SYMBOLS); WAVELET TRANSFORMS;

ALGORITHM DESIGN; COMPRESSED INDEXES; COMPRESSION ALGORITHMS; COMPRESSION BOOSTING LIBRARY;

DATA COMPRESSION;

EID: 33750716855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_67     Document Type: Conference Paper

References (24)

1. J. Abel. Post BWT stages of the Burrows-Wheeler compression algorithm. Submitted.
2. See also "A fast and efficient post BWT-stage for the Burrows-Wheeler compression algorithm". Proc. IEEE DCC, 2005, pag. 449.
3. S. Burkhardt and J. Kärkkäinen. Fast lightweight suffix array construction and checking. In Proc. 14th Symposium on Combinatorial Pattern Matching (CPM '03), pages 55-69. Springer-Verlag LNCS n. 2676, 2003.
4. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994.
5. S. Deorowicz. Context exhumation after the BurrowsWheeler transform. Information Processing Letters, 95:313-320, 2005.
6. P. Fenwick. Block sorting text compression - final report. Technical Report 130, Dept. of Computer Science, The University of Auckland New Zeland, 1996.
7. P. Ferragina, R. Giancarlo, and G. Manzini. The engineering of a compression boosting library: Theory vs practice in BWT compression. Technical Report TR-INF-2006-06-03-UNIPMN, http://www.di.unipmn.it, 2006.
8. P. Ferragina, R. Giancarlo, and G. Manzini. The myriad virtues of wavelet trees. In Proc. of International Colloquium on Automata and Languages (ICALP), pages 561-572. Springer Verlag LNCS n. 4051, 2006.
9. P. Ferragina, R. Giancarlo, G. Manzini, and M. Sciortino. Boosting textual compression in optimal linear time. Journal of the ACM, 52:688-713, 2005.
10. L. Foschini, R. Grossi, A. Gupta, and J. Vitter. Fast compression with a static model in high order entropy. In IEEE DCC, pages 62-71. IEEE Computer Society TCC, 2004.
11. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '03), pages 841-850, 2003.
12. R. Grossi, A. Gupta, and J. Vitter. When indexing equals compression: Experiments on compressing suffix arrays and applications. In Proc. 15th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '04), pages 636-645, 2004.
13. H. Kaplan, S. Landau, and E. Verbin. A simpler analysis of Burrows-Wheeler based compression. In Proc. of the 17th Symposium on Combinatorial Pattern Matching (CPM '06). Springer-Verlag LNCS, 2006.
14. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time longestcommon-prefix computation in suffix arrays and its applications. In Proc. 12th Symposium on Combinatorial Pattern Matching (CPM '01), pages 181-192. Springer-Verlag LNCS n. 2089, 2001.
15. M. Lundqvist. Carryless range coding, http://hem.spray.se/mikael. lundqvist/.
16. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.
17. G. Manzini. Two space saving tricks for linear time LCP computation. In Proc. of 9th Scandinavian Workshop on Algorithm Theory (SWAT '04), pages 372-383. Springer-Verlag LNCS n. 3111, 2004.
18. G. Manzini and P. Ferragina. Engineering a lightweight suffix array construction algorithm. Algorithmica, 40:33-50, 2004.
19. G. Navarro and V. Mäkinen. Compressed full text indexes. Technical Report TR/DCC-2006-6, Dept. of Computer Science, University of Chile, 2006.
20. J. Seward. The BZIP2 home page, 2006. http://www.bzip.org.
21. D. Shkarin. PPMd compressor Ver. J. http://www.compression.ru/ds/.
22. D. Shkarin. PPM: One step to practicality. In IEEE Data Compression Conference, pages 202-211, 2002.
23. D. Wheeler. Improving Huffman coding, 1997. ftp://ftp.cl.cam.ac.uk/users/ djw3/huff.ps.
24. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, 1987.