Next Article in Journal
Exact and Heuristic Algorithms for Thrift Cyclic Scheduling
Next Article in Special Issue
Interactive Compression of Digital Data
Previous Article in Journal
A Framework for Bioacoustic Vocalization Analysis Using Hidden Markov Models
Previous Article in Special Issue
Multiplication Symmetric Convolution Property for Discrete Trigonometric Transforms
Algorithms 2009, 2(4), 1429-1448; doi:10.3390/a2041429

Linear-Time Text Compression by Longest-First Substitution

1, 2,* , 1
1, 1
1 Department of Informatics, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan 2 Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan 3 Graduate School of Information Sciences, Tohoku University, Aoba 6-6-05, Aramaki, Sendai 980-8579, Japan
* Author to whom correspondence should be addressed.
Received: 30 September 2009 / Accepted: 20 November 2009 / Published: 25 November 2009
(This article belongs to the Special Issue Data Compression)
View Full-Text   |   Download PDF [267 KB, uploaded 26 November 2009]   |   Browse Figures


We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol. We present the first linear-time algorithm for LFS. Our algorithm employs a new data structure called sparse lazy suffix trees. We also deal with a more sophisticated version of LFS, called LFS2, that allows better compression. The first linear-time algorithm for LFS2 is also presented.
Keywords: grammar-based text compression; suffix trees; linear-time algorithms grammar-based text compression; suffix trees; linear-time algorithms
This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

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

Nakamura, R.; Inenaga, S.; Bannai, H.; Funamoto, T.; Takeda, M.; Shinohara, A. Linear-Time Text Compression by Longest-First Substitution. Algorithms 2009, 2, 1429-1448.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


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