Compression boosting in optimal linear time using the Burrows-Wheeler Transform

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 648-656

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

^a Dipartimento di Informatica   (Italy)

^b UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^c CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; STATISTICAL METHODS; THEOREM PROVING;

BURROWS-WHEELER TRANSFORMS; COMPRESSION BOOSTERS;

DYNAMIC PROGRAMMING;

EID: 1842591893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Z. Arnavut. Generalization of the BWT transformation and inversion ranks. In Proc. IEEE Data Compression Conference, page 447, 2002.
2. B. Balkenhol, S. Kurtz, and Y. M. Shtarkov. Modification of the Burrows and Wheeler data compression algorithm. In Proceedings of IEEE Data Compression Conference, 1999.
3. M. Burrows and D. Wheeler, A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
4. S. Deorowicz. Second step algorithms in the Burrows-Wheeler compression algorithm. Software Practice and Experience, 32(2):99-111, 2002.
5. P. Fenwick. The Burrows-Wheeler transform for block sorting text compression: principles and improvements. The Computer Journal, 39(9):731-740, 1996.
6. P. Ferragina and G. Manzini. Opportunistic data structures with applications, In Proc. of the 41st IEEE Symposium on Foundations of Computer Science, pages 390-398, 2000.
7. R. Giancarlo and M. Sciortino. Optimal partitions of strings: A new class of Burrows-Wheeler compression algorithms. In Combinatorial Pattern Matching Conference (CPM'03), pages 129-143, 2003.
8. R. Grossi, A. Gupta, and J. Vitter. Indexing equals compression: Experiments on suffix arrays and trees. In Proc. 15th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'04), 2004. This volume.
9. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.
10. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
11. J. Seward. The BZIP2 home page, 1997. http://sources.redhat.com/bzip2.
12. A. Wirth and A. Mo at. Can we do without ranks in Burrows-Wheeler transform compression? In Proc. IEEE Data Compression Conference, pages 419-428, 2001.