An analysis of the Burrows-Wheeler transform

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An analysis of the Burrows-Wheeler transform

Full text

Pdf (929 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 669 - 677

Year of Publication: 1999

ISBN:0-89871-434-6

Author

Giovanni Manzini

Dipartimento di Scienze e Tecnologie Avanzate, Università del, Piemonte Orientale, I-15100, Alesandria and IMC-CNR, Via S. Maria, 46, Pisa, Italy

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 21, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jon Louis Bentley , Daniel D. Sleator , Robert E. Tarjan , Victor K. Wei, A locally adaptive data compression scheme, Communications of the ACM, v.29 n.4, p.320-330, April 1986 [doi>10.1145/5684.5688]
	2	M. Burrows and D. J. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994.
	3	J. (3. Cleary and W. J. Teahan. Unbounded length contexts for PPM. The Computer Journal, 40(2/3):67- 75, 1997.
	4	G. V. Ormack , R. N. S. Horspool, Data compression using dynamic Markov modelling, The Computer Journal, v.30 n.6, p.541-550, Dec. 1987
	5	P. 'Fenwick. Block sorting text compression -- final report. Technical Report 130, Dept. of Computer Science, The University of Auckland New Zeland, 1996. ftp ://ftp. cs. auckland, ac. nzlout/pet;er-f/.
	6	P. Fenwick. The Burrows-Wheeler transform for block sorting text compression: principles and improvements. The Computer Journal, 39(9):731-740, 1996.
	7	Paul G. Howard , Jeffrey Scott Vitter, Analysis of arithmetic coding for data compression, Information Processing and Management: an International Journal, v.28 n.6, p.749-763, Nov.–Dec. 1992 [doi>10.1016/0306-4573(92)90066-9]
	8	S. Kosaraju , G. Manzini, Compression of Low Entropy Strings with Lempel-Ziv Algorithms, Proceedings of the Compression and Complexity of Sequences 1997, p.107, June 11-13, 1997
	9	A. Moffat. Implementing the PPM data compression scheme. IEEE Transactions on Communications, 38:1917-1921, 1990.
	10	B. Y. Ryabko. Data compression by means of a 'book stack'. Prob.In}. Transm, 16(4), 1980.
	11	K. Sadakane, Text Compression using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM, Proceedings of the Compression and Complexity of Sequences 1997, p.305, June 11-13, 1997
	12	K. Sad "akane. On optimality of variants of the block sorting compression. Manuscript, 1998.
	13	.}. Seward. The bzip2 home page, 1997. http ://www,muraroa,demon, co,uk,
	14	Jeffrey Scott Vitter, Design and analysis of dynamic Huffman codes, Journal of the ACM (JACM), v.34 n.4, p.825-845, Oct. 1987 [doi>10.1145/31846.42227]
	15	D. Wheeler. An implementation of block coding, October 1995. ftp : llft;p, el. cam. ac. uklusers/dj w3/bred.ps.
	16	Ian H. Witten , Radford M. Neal , John G. Cleary, Arithmetic coding for data compression, Communications of the ACM, v.30 n.6, p.520-540, June 1987 [doi>10.1145/214762.214771]