Information distance and its applications

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

Volumn 4094 LNCS, Issue , 2006, Pages 1-9

  Li, Ming ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INTERNET; PROBLEM SOLVING; QUERY LANGUAGES;

GENOME PHYLOGENY; INFORMATION DISTANCE; INTERNET QUERY-ANSWER SYSTEMS;

INFORMATION ANALYSIS;

EID: 33749405176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11812128_1     Document Type: Conference Paper

References (31)

1. C. Ané and M.J. Sanderson, Missing the Forest for the Trees: Phylogenetic Compression and Its Implications for Inferring Complex Evolutionary Histories, Systematic Biology, 54:1(2005), 146-157.
2. C.H. Bennett, P. Gacs, M. Li, P. Vitanyi, and W. Zurek, Information Distance, IEEE Trans. Inform. Theory, 44:4(July 1998), 1407-1423. (STOC, 1993)
3. C.H. Bennett, M. Li and B. Ma, Chain letters and evolutionary histories, Scientific American, 288:6(June 2003) (feature article), 76-81.
4. D. Benedetto, E. Caglioti, V. Loreto, Language trees and zipping, Phys. Rev. Lett., 88:4(2002), 048702.
5. X. Chen, B. Francia, M. Li, B. Mckinnon, A. Seker. Shared information and program plagiarism detection. IEEE Trans. Information Theory, 50:7(July 2004), 1545-1550.
6. A.V. Chernov, An.A. Muchnik, A.E. Romashchenko, A.K. Shen and N.K. Vereshchagin, Upper semi-lattice of binary strings with the relation "x is simple conditional to y", Theoret. Comput. Sci., 271(2002), 69-95.
7. R. Cilibrasi, P.M.B. Vitányi, and R. de Wolf Algorithmic clustring of music based on string compression. Comput. Music J., 28:4(2004), 49-67.
8. R. Cilibrasi and P.M.B. Vitányi, Automatic semantics using Google. manuscript, 2005. http://arxiv.org/abs/cs.CL/0412098 (2004).
9. R. Cilibrasi and P.M.B. Vitányi, Clustering by compression, IEEE Trans. Inform. Theory, 51:4(2005), 1523-1545.
10. M. Cuturi and J.P. Vert, The context-tree kernel for strings. Neural Networks, 18:4(2005), 1111-1123.
11. K. Emanuel, S. Ravela, E. Vivant, C. Risi, A combined statistical-deterministic approach of hurricane risk assessment, manuscript, Program in Atmospheres, Oceans, and Climate, MIT, 2005.
12. Y. Hao, X. Zhang, X. Zhu, and M. Li, Conditional normalized information distance. Manuscript, 2006.
13. E. Keogh, S. Lonardi, and C.A. Ratanamahatana, Towards parameter-free data mining, KDD'2004, pp. 206-215.
14. S.R. Kirk and S. Jenkins, Information theory-baed software metrics and obfuscation, [J. Systems and Software, 72(2004), 179-186] and
15. A. Kraskov, H. Stögbauer, R.G. Andrzejak, and P. Grassberger, Hierarchical clustering using mutual information, Europhys. Lett. 70:2(2005), 278-284.
16. A. Kocsor, A. Kertesz-Farkas, L. Kajan, and S. Pongor, Application of compression-based distance measures to protein sequence classification: a methodology study, Bioinformatics, 22:4(2006), 407-412;
17. N. Krasnogor and D.A. Pelta, Measuring the similarity of protein structures by means of the universal similarity metric. Bioinformatics 20:7(2004), 1015-1021];
18. M. Li, J. Badger, X. Chen, S. Kwong, P. Kearney, H. Zhang, An information-based sequence distance and its application to whole mitochondrial genome phylogeny, Bioinformatics, 17:2(2001), 149-154.
19. M. Li, X. Chen, X. Li, B. Ma, P.M.B. Vitanyi, The similarity metric, IEEE Trans. Information Theory, 50:12(2004), 3250-3264.
20. M. Li and P. Vitanyi, An introduction to Kolmogorov complexity and its applications, Springer-Verlag, 2nd Edition 1997 (xx+637 pp).
21. An.A. Muchnik, Conditional comlexity and codes, Theoretical Computer Science 271:1(2002), 97-109.
22. An.A. Muchnik and N.K. Vereshchagin, Logical operations and Kolmogorov complexity II. Proc. 16th Conf. Comput. Complexity, 2001, pp. 256-265.
23. H.H. Otu and K. Sayood, Bioinformatics 19:6(2003), 2122-2130. A new sequence distance measure for phylogenetic tree construction.
24. H.K. Pao and J. Case, Computing entropy for ortholog detection. Int'l Conf. Comput. Intell. Dec. 17-19, 2004, Istanbul Turkey.
25. D. Parry, Use of Kolmogorov distance identification of web page authorship, topic and domain, Workshop on Open Source Web Inf. Retrieval, http://www.emse.fr/OSWIR05/, 2005.
26. C. Costa Santos, J. Bernardes, P.M.B. Vitányi, L. Antunes, Clustering fetal heart rate tracings by compression, Proc. 19th IEEE Intn'l Symp. Computer-Based Medical Systems, Salt Lake City, Utah, 22-23 June, 2006.
27. A.K. Shen and N.K. Vereshchagin, Logical operations and Kolmogorov complexity, Theoret. Comput. Sci. 271(2002), 125-129.
28. W. Taha, S. Crosby, and K. Swadi, A new approach to data mining for software design, manuscript, Rice Univ. 2006.
29. J.S. Varre, J.P. Delahaye, and E. Rivals, Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics, 15:3(1999), 194-202.
30. N.K. Vereshchagin and M.V. V'yugin, Independent minimum length programs to translate between given strings, Theoret. Comput. Sci., 271(2002), 131-143.
31. M.V. V'yugin, Information distance and conditional complexities Theoret. Comput. Sci., 271(2002), 145-150.