Algorithmica

, Volume 65, Issue 3, pp 685–709

Sublinear Algorithms for Approximating String Compressibility

  • Sofya Raskhodnikova
  • Dana Ron
  • Ronitt Rubinfeld
  • Adam Smith
Article

DOI: 10.1007/s00453-012-9618-6

Cite this article as:
Raskhodnikova, S., Ron, D., Rubinfeld, R. et al. Algorithmica (2013) 65: 685. doi:10.1007/s00453-012-9618-6

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 lemmas that relate the compressibility of a string with respect to LZ77 to the number of distinct short substrings contained in it (its th 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.

Keywords

Sublinear algorithms Lossless compression Run-length encoding Lempel-Ziv 

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Sofya Raskhodnikova
    • 1
  • Dana Ron
    • 2
  • Ronitt Rubinfeld
    • 2
    • 3
  • Adam Smith
    • 1
  1. 1.Pennsylvania State UniversityUniversity ParkUSA
  2. 2.Tel Aviv UniversityTel AvivIsrael
  3. 3.MITCambridgeUSA