Optimal partitions of strings: A new class of Burrows-Wheeler compression algorithms

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

Volumn 2676, Issue , 2003, Pages 129-143

  Giancarlo, Raffaele ^a   Sciortino, Marinella ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN MATCHING;

BURROWS WHEELER TRANSFORM; COMPRESSION ALGORITHMS; COMPRESSION PROCESS; LOSSLESS DATA COMPRESSION; MOVE-TO-FRONT; OPTIMAL PARTITIONS; PARTITIONING TECHNIQUES; WHEELER ALGORITHMS;

DATA COMPRESSION;

EID: 35248819207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_10     Document Type: Article

References (20)

1. Burrows, M., Wheeler, D.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)
2. Fenwick, P.: The Burrows-Wheeler transform for block sorting text compression. The Computer Journal 39 (1996) 731-740
3. Buchsbaum, A.L., Caldwell, D.F., Church, K.W., Fowler, G.S., Muthukrishnan, S.: Engineering the compression of massive tables: An experimental approach. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms. (2000) 175-184
4. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 (2001) 407-430
5. Bentley, J., Sleator, D., Tarjan, R., Wei, V.: A locally adaptive data compression scheme. Comm. of ACM 29 (1986) 320-330
6. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Interscience (1990)
7. Effros, M.: Universal lossless source coding with the Burrows-Wheeler transform. In: Proc. IEEE Data Compression Conference, IEEE Computer Society (1999) 178-187
8. Sadakane, K.: On optimality of variants of the block sorting compression. In: Proc. IEEE Data Compression Conference, IEEE Computer Society (1998) 570
9. Arnavut, Z., Magliveras, S.S.: Block sorting and compression. In: Proc. IEEE Data Compression Conference, IEEE Computer Society (1997) 181-190
10. Balkenhol, B., Kurtz, S.: Universal data compression based on the Burrows and Wheeler-transformation: Theory and practice. Technical Report 98-069, Sonderforshunngsbereich: Diskrete Strukturen in der Mathematik, Universität Bielefeld, Germany (1998) Available from http://www.mathematik.uni-bielefeld.de/sfb343/preprints.
11. Wirth, A.I., Moffat, A.: Can we do without ranks in Burrows Wheeler transform compression? In: Proc. IEEE Data Compression Conference, IEEE Computer Society (2001) 419-428
12. Buchsbaum, A.L., Giancarlo, R., Fowler, G.S.: Improving table compression with combinatorial optimization. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms. (2002) 213-222
13. Lempel, A., Ziv, J.: A universal algorithm for sequential data compression. IEEE Trans. on Information Theory IT-23 (1977) 337-343
14. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. on Information Theory IT-24 (1978) 530-578
15. Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. on Communication COM-38 (1990) 1917-1921
16. Cormak, G., Horspool, R.: Data compression using dynamic markov modelling. Computer J. 30 (1987) 541-550
17. Cleary, J., Teahan, W.: Unbounded length contexts for PPM. Computer J. 40 (1997) 67-75
18. Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 21 (1975) 194-203
19. Levenshtein, V.: On the redundancy and delay of decodable coding of natural numbers. (Translation from) Problems in Cybernetics, Nauka, Mscow 20 (1968) 173-179
20. Capocelli, R.M., Giancarlo, R., Taneja, I.: Bounds on the redundancy of Huffman codes. IEEE Transactions on Information Theory 32 (1986) 854-8571