Algorithms for estimating information distance with application to bioinformatics and linguistics

Canadian Conference on Electrical and Computer Engineering

Volumn 4, Issue , 2004, Pages 2255-2258

  Kaltchenko, Alexei ^a  

^a WILFRID LAURIER UNIVERSITY   (Canada)

Author keywords

Bioinformatics; Conditional entropy; Data compression; Divergence estimation; Entropy estimation; Information distance; Kolmogorov complexity; Kullback Leibler divergence; Relative entropy; Side information

Indexed keywords

BIOINFORMATICS; CONDITIONAL ENTROPY; ENTROPY ESTIMATION; INFORMATION DISTANCE; KOLMOGOROV COMPLEXITY; KULLBACK-LEIBLER DIVERGENCE; RELATIVE ENTROPY;

ALGORITHMS; DATA COMPRESSION; DNA; ENTROPY; PARAMETER ESTIMATION; SPATIAL VARIABLES MEASUREMENT;

COMPUTATIONAL COMPLEXITY;

EID: 4944223353     PISSN: 08407789     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCECE.2004.1347695     Document Type: Conference Paper

References (10)

1. F. Behr, V. Fossum, M. Mitzenmacher, and D. Xiao, "Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression", the 2003 Data Compression Conference (DCC 2003), p. 416, USA.
2. D. Benedetto, E. Caglioti, and V. Loreto, "Language Trees and Zipping", Physical Review Letters, Vol. 88, No. 4, Jan 2002.
3. C. Bennett, P. Gacs, M. Li, P. Vitanyi, W. Zurek, "Information distance"," IEEE Trans. Inform. Theory, Vol. 44, No. 4, pp. 1407 - 1423, July 1998.
4. H. Cai, S. Kulkarni, and S. Verdu, "Universal Estimation of Entropy and Divergence Via Block Sorting," Proc. of the 2002 IEEE Intern. Symp. Inform. Theory, p.433, USA, 2002.
5. X. Chen, S. Kwong, M. Li, "A compression algorithm for DNA Sequences", IEEE-EMB Special Issue on Bioinformatics, Vol. 20, No. 4, pp. 61-66, 2001.
6. J. Kieffer, En-hui Yang, "Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity", IEEE Trans. Inform. Theory, Vol. 42, No. 1, pp. 29-39, 1996.
7. M. Li, X. Chen, X. Li, B. Ma, and P. Vitanyi, "The similarity metric", the Proceeding of the 14th annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 863-872, 2003.
8. M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer, New York, 1997, 2nd ed.
9. En-hui Yang, A. Kaltchenko, and J. Kieffer, "Universal lossless data compression with side information by using a conditional MPM grammar transform," IEEE Trans. Inform. Theory, Vol. 47, No. 6, pp. 2130-2150, Sep. 2001.
10. J. Ziv and N. Merhav, "A measure of relative entropy between individual sequences with application to universal classification", IEEE Trans. Inform. Theory, Vol. 39, No. 4, pp. 1270-1279, July 1993.