Next Article in Journal / Special Issue
Content Sharing Graphs for Deduplication-Enabled Storage Systems
Previous Article in Journal
Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs
Previous Article in Special Issue
A Semi-Preemptive Computational Service System with Limited Resources and Dynamic Resource Ranking
Algorithms 2012, 5(2), 214-235; doi:10.3390/a5020214
Article

An Online Algorithm for Lightweight Grammar-Based Compression

1
,
2
 and
1,*
1 Department of Informatics, Kyushu University, 744 Motooka Nishi-ku Fukuoka-shi, Fukuoka, Japan 2 Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology,680-4 Kawazu Iizuka-shi Fukuoka, Japan
* Author to whom correspondence should be addressed.
Received: 30 January 2012 / Revised: 26 March 2012 / Accepted: 28 March 2012 / Published: 10 April 2012
(This article belongs to the Special Issue Data Compression, Communication and Processing)
Download PDF [347 KB, 24 April 2012; original version 10 April 2012]

Abstract

Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression. Our algorithm guarantees O(log2 n)- approximation ratio for the minimum grammar size, where n is an input size, and it runs in input linear time and output linear space. In addition, we propose a practical encoding, which transforms a restricted CFG into a more compact representation. Experimental results by comparison with standard compressors demonstrate that our algorithm is especially effective for highly repetitive text.
Keywords: lossless compression; grammar-based compression; online algorithm; approximation algorithm lossless compression; grammar-based compression; online algorithm; approximation algorithm
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
RIS
MDPI and ACS Style

Maruyama, S.; Sakamoto, H.; Takeda, M. An Online Algorithm for Lightweight Grammar-Based Compression. Algorithms 2012, 5, 214-235.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert