Sublinear Algorithms for Approximating String Compressibility

Details Sublinear Algorithms for Approximating String Compressibility Sublinear Algorithms for Approximating String Compressibility

2007-06-08

arxiv.org/abs/0706.1084v1

Computer Science

Data Structures and Algorithms

To appear in the proceedings of RANDOM 2007

Scientific paper

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 Lempel-Ziv (LZ), 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 LZ 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 Lempel-Ziv to the number of distinct short substrings contained in it. In addition, we show that approximating the compressibility with respect to LZ is related to approximating the support size of a distribution.

Affiliated with

Also associated with

No associations

Rating

Sublinear Algorithms for Approximating String Compressibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sublinear Algorithms for Approximating String Compressibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sublinear Algorithms for Approximating String Compressibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652148