• Abstract
• Full-Text PDF [267 KB]

• Article Statistics
• Google Scholar
• Order Reprints

• Cite this article
• Export to BibTeX
• Export to EndNote

• [+] on DOAJ
• Nakamura, R
• Inenaga, S
• Bannai, H
• Funamoto, T
• Takeda, M
• Shinohara, A
• [+] on Google Scholar
• Nakamura, R
• Inenaga, S
• Bannai, H
• Funamoto, T
• Takeda, M
• Shinohara, A
• [+] on PubMed
• Nakamura, R
• Inenaga, S
• Bannai, H
• Funamoto, T
• Takeda, M
• Shinohara, A

•  CiteULike
•  Facebook
•  Mendeley
•  Twitter

This article is

• freely available
• re-usable

Algorithms 2009, 2(4), 1429-1448; doi:10.3390/a2041429

Article

Linear-Time Text Compression by Longest-First Substitution

Ryosuke Nakamura ¹ , Shunsuke Inenaga ^2,* , Hideo Bannai ¹ , Takashi Funamoto ¹ , Masayuki Takeda ¹  and Ayumi Shinohara ³

¹ Department of Informatics, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan ² Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan ³ 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)

Download PDF Full-Text [267 KB, uploaded 26 November 2009 11:50 CET]

Abstract: 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

Article Statistics

Cite This Article