The burrows-wheeler transform: Theory and practice

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

Volumn 1672, Issue , 1999, Pages 34-47

  Manzini, Giovanni ^a,b  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ALGORITHMIC ISSUES; BURROWS-WHEELER TRANSFORM; INPUT STRING; NEW APPROACHES; THEORY AND PRACTICE;

BACKWARD WAVE TUBES;

EID: 49749104952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_4     Document Type: Conference Paper

References (39)

1. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Software-Practice and Experience, 25(2):129-141, 1995.
2. R. Arnold and T. Bell. The Canterbury corpus home page, http://corpus.canterbury.ac.nz.
3. S. Kurtz B. Balkenhol. Universal data compression based on the burrows and wheeler transformation: Theory and practice. Technical Report 98-069, Universität Bielefeld, 1998. http://www.mathematik.uni-bielefeld.de/sfb343/preprints/.
4. Y. M. Shtarkov B. Balkenhol, S. Kurtz. Modification of the burrows and wheeler data compression algorithm. In DCC: Data Compression Conference. IEEE Computer Society TCC, 1999.
5. J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 360-369, New Orleans, Louisiana, 1997.
6. J. Bentley, D. Sleator, R. Tarjan, and V. Wei. A locally adaptive data compression scheme. Communications of the ACM, 29(4):320-330, April 1986.
7. M. Burrows and D. J. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994.
8. J. G. Cleary and W. J. Teahan. Unbounded length contexts for PPM. The Computer Journal, 40(2/3):67-75, 1997.
9. G. V. Cormack and R. N. S. Horspool. Data compression using dynamic Markov modelling. The Computer Journal, 30(6):541-550, 1987.
10. M. Effros. Universal lossless source coding with the burrows wheeler transform. In DCC: Data Compression Conference. IEEE Computer Society TCC, 1999.
11. M. Farach and T. Thorup. String matching in Lempel-Ziv compressed strings. In ACM Symposium on Theory of Computing (STOC), 1995.
12. P. Fenwick. Block sorting text compression-final report. Technical Report 130, Dept, of Computer Science, The University of Auckland New Zeland, 1996.
13. P. Fenwick. The Burrows-Wheeler transform for block sorting text compression: principles and improvements. The Computer Journal, 39(9):731-740, 1996.
14. P. Fenwick. Symbol ranking text compression with Shannon recoding. J. UCS, 3(2):70-85, 1997.
15. P. Howard and J. Vitter. Analysis of arithmetic coding for data compression. Information Processing and Management, 28(6), 1992.
16. R. Kosaraju and G. Manzini. Compression of low entropy strings with Lempel-Ziv algorithms. SIAM J. on Computing, To Appear. Preliminary version in Proceedings Int. Conference on Compression and Complexity of Sequences, 102-121, 1997.
17. S. Kurtz. Reducing the space requirement of suffix trees. Technical Report 98-03, Universität Bielefeld, 1998. http://www.mathematik.uni-bielefeld.de/sfb343/preprints/.
18. N. J. Larsson. The context trees of block sorting compression. In Proceedings of the IEEE Data Compression Conference, pages 189-198, March-April 1998.
19. N. J. Larsson and K. Sadakane. Faster suffix sorting. Technical Report LU- CS-TR:99-214, LUNDFD6/(NFCS-3140)/l-43/(1999), Department of Computer Science, Lund University, Sweden, 1999.
20. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22(5):935-948, October 1993.
21. G. Manzini. An analysis of the Burrows-Wheeler transform, 1999. In preparation. Preliminary version in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA '99), 669-677.
22. G. Manzini. Efficient algorithms for on-line symbol ranking compression. In Proceedings of the 7th European Symposium on Algorithms (ESA '99). Springer Verlag, 1999.
23. E. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
24. D. Mcllroy. Ssort.c, 1997. http://cm.bell-lab8.com/cm/cs/wh0/d0ug/80urce.html.
25. A. Moffat. Implementing the PPM data compression scheme. IEEE Transactions on Communications, COM-38:1917-1921, 1990.
26. Mark R. Nelson. Data compression with the Burrows-Wheeler transform. Dr. Dobb's Journal of Software Tools, 21(9):46-50, 1996.
27. B. Y. Ryabko. Data compression by means of a 'book stack'. Prob.Inf. Transm, 16(4), 1980.
28. K. Sadakane. Text compression using recency rank with context and relation to context sorting, block sorting and PPM. In Proc. Int. Conference on Compression and Complexity of Sequences (SEQUENCES '91). IEEE Computer Society TCC, 1997.
29. K. Sadakane. On optimality of variants of the block sorting compression. In Data Compression Conference. IEEE Computer Society TCC, 1998.
30. K. Sadakane. A modified Burrows-Wheeler transformation for case-insensitive search with application to suffix array compression. In DCC: Data Compression Conference. IEEE Computer Society TCC, 1999.
31. D. Salomon. Data Compression: the Complete Reference. Springer Verlag, 1997.
32. M. Schindler. A fast block-sorting algorithm for lossless data compression. In Data Compression Conference. IEEE Computer Society TCC, 1997. http://eiunix.tuwien.ac.at/'michael/st/.
33. M. Schindler. The szip home page, 1997. http://www.compressconsult.com/szip/.
34. J. Sewaxd. The bzip2 home page, 1997. http://www.mur21roa.demon.co.uk.
35. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
36. J. Vitter. Design and analysis of dynamic Huffman codes. Journal of the ACM, 34(4):825-845, October 1987.
37. P. Weiner. Linear pattern matching algorithms. In Proc. 14th IEEE Annual Symposium on Switching and Automata Theory, pages 1-11, 1973.
38. I. Witten, R. Neal, and J. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, June 1987.
39. H. Yokoo. Data compression using a sort-based similarity measure. The Computer Journal, 40(2/3):94-102, 1997.