A Separation Between Run-Length SLPs and LZ77

11/20/2017

∙

In this paper we give an infinite family of strings for which the length of the Lempel-Ziv'77 parse is a factor Ω( n/ n) smaller than the smallest run-length grammar.

READ FULL TEXT

A Separation Between Run-Length SLPs and LZ77

Substring Complexities on Run-length Compressed Strings

CUSUM ARL - Conditional or Unconditional?

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings

Asymptotic convergence rate of the longest run in an inflating Bernoulli net

Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions

On the Algorithmic Probability of Sets

A Separation Between Run-Length SLPs and LZ77

Related Research

Substring Complexities on Run-length Compressed Strings

CUSUM ARL - Conditional or Unconditional?

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings

Asymptotic convergence rate of the longest run in an inflating Bernoulli net

Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions

On the Algorithmic Probability of Sets