Sublinear algorithms for approximating string compressibility

Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and a variant of Lempel-Ziv (LZ77), and present sublinear algorithms for approximating compressibility with respect to both schemes.We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly. Our investigation of LZ77 yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lem- mas that relate the compressibility of a string with respect to LZ77 to the number of distinct short substrings contained in it (its subword complexity, for small). In addition, we show that approximating the compressibility with respect to LZ77 is related to approximating the support size of a distribution.

Original languageEnglish (US)
Pages (from-to)685-709
Number of pages25
JournalAlgorithmica
Volume65
Issue number3
DOIs
StatePublished - Mar 1 2013

Fingerprint

Compressibility
Strings
Run-length Encoding
Subword
Lossless Compression
Lemma
Compression
Lower bound
Distinct

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

Raskhodnikova, S., Ron, D., Rubinfeld, R., & Smith, A. (2013). Sublinear algorithms for approximating string compressibility. Algorithmica, 65(3), 685-709. https://doi.org/10.1007/s00453-012-9618-6
Raskhodnikova, Sofya ; Ron, Dana ; Rubinfeld, Ronitt ; Smith, Adam. / Sublinear algorithms for approximating string compressibility. In: Algorithmica. 2013 ; Vol. 65, No. 3. pp. 685-709.
@article{a0dfb354e29a4102b5b2fac1677221fa,
title = "Sublinear algorithms for approximating string compressibility",
abstract = "We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and a variant of Lempel-Ziv (LZ77), and present sublinear algorithms for approximating compressibility with respect to both schemes.We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly. Our investigation of LZ77 yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lem- mas that relate the compressibility of a string with respect to LZ77 to the number of distinct short substrings contained in it (its subword complexity, for small). In addition, we show that approximating the compressibility with respect to LZ77 is related to approximating the support size of a distribution.",
author = "Sofya Raskhodnikova and Dana Ron and Ronitt Rubinfeld and Adam Smith",
year = "2013",
month = "3",
day = "1",
doi = "10.1007/s00453-012-9618-6",
language = "English (US)",
volume = "65",
pages = "685--709",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",

}

Raskhodnikova, S, Ron, D, Rubinfeld, R & Smith, A 2013, 'Sublinear algorithms for approximating string compressibility', Algorithmica, vol. 65, no. 3, pp. 685-709. https://doi.org/10.1007/s00453-012-9618-6

Sublinear algorithms for approximating string compressibility. / Raskhodnikova, Sofya; Ron, Dana; Rubinfeld, Ronitt; Smith, Adam.

In: Algorithmica, Vol. 65, No. 3, 01.03.2013, p. 685-709.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Sublinear algorithms for approximating string compressibility

AU - Raskhodnikova, Sofya

AU - Ron, Dana

AU - Rubinfeld, Ronitt

AU - Smith, Adam

PY - 2013/3/1

Y1 - 2013/3/1

N2 - We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and a variant of Lempel-Ziv (LZ77), and present sublinear algorithms for approximating compressibility with respect to both schemes.We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly. Our investigation of LZ77 yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lem- mas that relate the compressibility of a string with respect to LZ77 to the number of distinct short substrings contained in it (its subword complexity, for small). In addition, we show that approximating the compressibility with respect to LZ77 is related to approximating the support size of a distribution.

AB - We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and a variant of Lempel-Ziv (LZ77), and present sublinear algorithms for approximating compressibility with respect to both schemes.We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly. Our investigation of LZ77 yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lem- mas that relate the compressibility of a string with respect to LZ77 to the number of distinct short substrings contained in it (its subword complexity, for small). In addition, we show that approximating the compressibility with respect to LZ77 is related to approximating the support size of a distribution.

UR - http://www.scopus.com/inward/record.url?scp=84892932689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892932689&partnerID=8YFLogxK

U2 - 10.1007/s00453-012-9618-6

DO - 10.1007/s00453-012-9618-6

M3 - Article

AN - SCOPUS:84892932689

VL - 65

SP - 685

EP - 709

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3

ER -

Raskhodnikova S, Ron D, Rubinfeld R, Smith A. Sublinear algorithms for approximating string compressibility. Algorithmica. 2013 Mar 1;65(3):685-709. https://doi.org/10.1007/s00453-012-9618-6