LZRR: LZ77 Parsing with Right Reference

12/11/2018
by   Takaaki Nishimoto, et al.
0

Lossless data compression has been widely studied in computer science. One of the most widely used lossless data compressions is Lempel-Zip(LZ) 77 parsing, which achieves a high compression ratio. Bidirectional (a.k.a. macro) parsing is a lossless data compression and computes a sequence of phrases copied from another substring (target phrase) on either the left or the right position in an input string. Gagie et al.(LATIN 2018) recently showed that a large gap exists between the number of smallest bidirectional phrases of a given string and that of LZ77 phrases. In addition, finding the smallest bidirectional parse of a given text is NP-complete. Several variants of bidirectional parsing have been proposed thus far, but no prior work for bidirectional parsing has achieved high compression that is smaller than that of LZ77 phrasing for any string. In this paper, we present the first practical bidirectional parsing named LZ77 parsing with right reference (LZRR), in which the number of LZRR phrases is theoretically guaranteed to be smaller than the number of LZ77 phrases. Experimental results using benchmark strings show the number of LZRR phrases is approximately five percent smaller than that of LZ77 phrases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2018

On the Approximation Ratio of Greedy Parsings

Shannon's entropy is a clear lower bound for statistical compression. Th...
research
02/06/2023

Optimal LZ-End Parsing is Hard

LZ-End is a variant of the well-known Lempel-Ziv parsing family such tha...
research
03/05/2019

Lempel-Ziv-like Parsing in Small Space

Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widel...
research
08/24/2022

Hierarchical Relative Lempel-Ziv Compression

Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in ...
research
06/30/2022

Prefix-free parsing for building large tunnelled Wheeler graphs

We propose a new technique for creating a space-efficient index for larg...
research
03/04/2020

Approximating Optimal Bidirectional Macro Schemes

Lempel-Ziv is an easy-to-compute member of a wide family of so-called ma...
research
01/29/2019

Fully-functional bidirectional Burrows-Wheeler indexes

Given a string T on an alphabet of size σ, we describe a bidirectional B...

Please sign up or login with your details

Forgot password? Click here to reset