Sublinear algorithms for approximating string compressibility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 609-623

  Raskhodnikova, Sofya ^a   Ron, Dana ^b   Rubinfeld, Ronitt ^c   Smith, Adam ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA COMPRESSION; ENCODING (SYMBOLS);

COMBINATORIAL STRUCTURAL LEMMAS; COMPRESSION SCHEMES; SUBLINEAR ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 38049015443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_44     Document Type: Conference Paper

References (20)

1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137-147 (1999)
2. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling algorithms: lower bounds and applications. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, New York, NY, USA, 2001, pp. 266-275. ACM Press, New York (2001)
3. Batu, T., Dasgupta, S., Kumar, R., Rubinfeld, R.: Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, and Ronitt Rubinfeld. SIAM Journal on Computing 35(1), 132-150 (2005)
4. Benedetto, D., Caglioti, E., Loreto, V.: Language trees and zipping. Phys. Rev. Lett. 88(4) (2002). (See comment by Khmelev DV, Teahan WJ, Phys Rev Lett. 90(8):089803, (2003) and the reply Phys Rev Lett. 90(8):089804, 2003)
5. Brautbar, M., Samorodnitsky, A.: Approximating the entropy of large alphabets. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2007)
6. Bunge, J.: Bibligraphy on estimating the number of classes in a population, http://www.stat.Cornell.edu/~bunge/bibliography.htm
7. Charikar, M., Chaudhuri, S., Motwani, R., Narasayya, V.R.: Towards estimation error guarantees for distinct values. In: PODS, pp. 268-279. ACM, New York (2000)
8. Cilibrasi, R., Vitányi, P.M.B.: Clustering by compression. IEEE Transactions on Information Theory 51(4), 1523-1545 (2005)
9. Cilibrasi, R., Vitányi, P.M.B.: Similarity of objects and the meaning of words. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 21-45. Springer, Heidelberg (2006)
10. Cover, T., Thomas, J.: Elements of Information Theory. Wiley & Sons, Chichester (1991)
11. Kukushkina, O.V., Polikarpov, A.A., Khmelev, D.V.: Using literal and grammatical statistics for authorship attribution. Prob. Peredachi Inf. 37(2), 96-98 (2000) [Probl. Inf. Transm. (Engl. Transl.) 37, 172-184 (2001)]
12. Lehman, E., Shelat, A.: Approximation algorithms for grammer-based compression. In: Proc. 18th Annual Symp. on Discrete Algorithms, 2002, pp. 205-212 (2002)
13. Li, M., Chen, X., Li, X., Ma, B., Vitányi, P.M.B.: The similarity metric. IEEE Transactions on Information Theory 50(12), 3250-3264 (2004) (Prelim, version in SODA 2003)
14. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (1997)
15. Loewenstern, D., Hirsh, H., Noordewier, M., Yianilos, P.: DNA sequence classification using compression-based induction. Technical Report 95-04, Rutgers University, DIMACS (1995)
16. Raskhodnikova, S., Ron, D., Rubinfeld, R., Shpilka, A., Smith, A.: Sublinear algorithms for approximating string compressibility and the distribution support size. Electronic Colloquium on Computational Complexity, TR05-125 (2005)
17. Raskhodnikova, S., Ron, D., Rubinfeld, R., Smith, A.: Sublinear algorithms for approximating string compressibility. Full version of this paper, in preparation, Arxiv Report 0706.1084 [cs.DS] (June 2007)
18. Raskhodnikova, S., Ron, D., Shpilka, A., Smith, A.: On the difficulty of approximating the support size of a distribution. (Manuscript 2007)
19. Ziv, J., Lernpel, A.: A universal algorithm for sequential data compression. TEEE Transactions on Information Theory 23, 337-343 (1977)
20. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24, 530-536 (1978)