Linear-Time Text Compression by Longest-First Substitution
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 structur...
Main Authors: | Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Takashi Funamoto, Ryosuke Nakamura, Shunsuke Inenaga |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2009-11-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/2/4/1429/ |
Similar Items
-
Compressed Communication Complexity of Hamming Distance
by: Shiori Mitsuya, et al.
Published: (2021-04-01) -
Approximate String Matching with Compressed Indexes
by: Pedro Morales, et al.
Published: (2009-09-01) -
A Fast Algorithm for the Largest Area First Parsing of Real Strings
by: Ivan Katanic, et al.
Published: (2020-01-01) -
Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings
by: Danny Hucke, et al.
Published: (2021-02-01) -
An Online Algorithm for Lightweight Grammar-Based Compression
by: Masayuki Takeda, et al.
Published: (2012-04-01)