Abstract
Universal compression and leaning has been interacting with each other. This paper combines two compression schemes, PPM (Prediction by Partial Match) and CTW (Context Tree Weighting), to a scheme which can predict the multi-alphabet probabilities to attain better compression ratio.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Åberg and Y. M. Shtarkov. Text compression by context tree weighting. In IEEE Data Compression Conference, pages 377–386, March 1997.
C. Bloom. Solving the problems of context modeling, March 1998. http://www.cco.caltech.edu/~bloom/papers/ppmz.zip.
J. G. Cleary and W. J. Teahan. Experiments on the zero frequency problem. In IEEE Data Compression Conference, page 480, April 1995.
J. G. Cleary and I. H. Witten. Data compression using adaptive coding and partial string matching. IEEE Trans. Communications, COM-32(4):396–402, 1984.
T. Matsumoto. DNA sequence compression algorithms. Bachelor’s thesis, University of Tokyo, Department of Information Science, Faculty of Science, 2000.
T. Matsumoto, K. Sadakane, H. Imai, and T. Okazaki. Can general-purpose compression schemes really compress DNA sequences? In Currents in Computational Molecular Biology, pages 76–77, 2000. Poster at RECOMB 2000.
A. Moffat. Implementing the PPM compression scheme. IEEE Transactions on Communications, COM-38(11):1917–1921, November 1990.
T. Okazaki. Data Compression Method Combining Properties of PPM and CTW. Master’s thesis, University of Tokyo, March 2001.
T. Okazaki and H. Imai. Optimization of weighting parameters for CTW data compression. IPSJ SIG Note SIGAL-75-9, IPSJ, November 2000. (in Japanese).
K. Sadakane, T. Okazaki, and H. Imai. Implementing the context tree weighting method for text compression. In IEEE Data Compression Conference, March 2000.
K. Sadakane, T. Okazaki, T. Matsumoto, and H. Imai. Implementing the context tree weighting method by using conditional probabilities. In The 22nd Symposium on Information Theory and Its Applications. SITA, December 1999. (in Japanese).
W. J. Teahan. PPMD+. Program. http://www.cs.waikato.ac.nz/~wjt/software/ppm.tar.gz.
T. J. Tjalkens, P. A. J. Volf, and F. M. J. Willems. A context-tree weighting method for text generating sources. In IEEE Data Compression Conference, page 472, March 1997. Posters at http://ei1.ei.ele.tue.nl/~paul/p and w/dcc97p.ps.gz.
F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens. The context tree weighting method: Basic properties. IEEE Trans. Inform. Theory, IT-41(3):653–664, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Okazaki, T., Sadakane, K., Imai, H. (2002). Data Compression Method Combining Properties of PPM and CTW. In: Arikawa, S., Shinohara, A. (eds) Progress in Discovery Science. Lecture Notes in Computer Science(), vol 2281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45884-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-45884-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43338-5
Online ISBN: 978-3-540-45884-5
eBook Packages: Springer Book Archive