{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T12:10:25Z","timestamp":1736511025048,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_1","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"1-9","source":"Crossref","is-referenced-by-count":1,"title":["Information Distance and Its Applications"],"prefix":"10.1007","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1080\/10635150590905984","volume":"54","author":"C. An\u00e9","year":"2005","unstructured":"An\u00e9, C., Sanderson, M.J.: Missing the Forest for the Trees: Phylogenetic Compression and Its Implications for Inferring Complex Evolutionary Histories. Systematic Biology\u00a054(1), 146\u2013157 (2005)","journal-title":"Systematic Biology"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"C.H. Bennett","year":"1998","unstructured":"Bennett, C.H., Gacs, P., Li, M., Vitanyi, P., Zurek, W.: Information Distance. IEEE Trans. Inform. Theory\u00a044(4), 1407\u20131423 (1998) (STOC, 1993)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1038\/scientificamerican0603-76","volume":"288","author":"C.H. Bennett","year":"2003","unstructured":"Bennett, C.H., Li, M., Ma, B.: Chain letters and evolutionary histories. Scientific American\u00a0288(6), 76\u201381 (2003) (feature article)","journal-title":"Scientific American"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"48702","DOI":"10.1103\/PhysRevLett.88.048702","volume":"88","author":"D. Benedetto","year":"2002","unstructured":"Benedetto, D., Caglioti, E., Loreto, V.: Language trees and zipping. Phys. Rev. Lett.\u00a088(4), 048702 (2002)","journal-title":"Phys. Rev. Lett."},{"issue":"7","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1109\/TIT.2004.830793","volume":"50","author":"X. Chen","year":"2004","unstructured":"Chen, X., Francia, B., Li, M., Mckinnon, B., Seker, A.: Shared information and program plagiarism detection. IEEE Trans. Information Theory\u00a050(7), 1545\u20131550 (2004)","journal-title":"IEEE Trans. Information Theory"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00032-9","volume":"271","author":"A.V. Chernov","year":"2002","unstructured":"Chernov, A.V., Muchnik, A., Romashchenko, A.E., Shen, A.K., Vereshchagin, N.K.: Upper semi-lattice of binary strings with the relation x is simple conditional to y. Theoret. Comput. Sci.\u00a0271, 69\u201395 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1162\/0148926042728449","volume":"28","author":"R. Cilibrasi","year":"2004","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B., de Wolf, R.: Algorithmic clustring of music based on string compression. Comput. Music J.\u00a028(4), 49\u201367 (2004)","journal-title":"Comput. Music J."},{"key":"1_CR8","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: Automatic semantics using Google (manuscript, 2005) (2004), http:\/\/arxiv.org\/abs\/cs.CL\/0412098"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: Clustering by compression. IEEE Trans. Inform. Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.neunet.2005.07.010","volume":"18","author":"M. Cuturi","year":"2005","unstructured":"Cuturi, M., Vert, J.P.: The context-tree kernel for strings. Neural Networks\u00a018(4), 1111\u20131123 (2005)","journal-title":"Neural Networks"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Emanuel, K., Ravela, S., Vivant, E., Risi, C.: A combined statistical-deterministic approach of hurricane risk assessment. Program in Atmospheres, Oceans, and Climate. MIT (manuscript, 2005)","DOI":"10.1175\/BAMS-87-3-299"},{"key":"1_CR12","unstructured":"Hao, Y., Zhang, X., Zhu, X., Li, M.: Conditional normalized information distance (manuscript, 2006)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Keogh, E., Lonardi, S., Ratanamahatana, C.A.: Towards parameter-free data mining. In: KDD 2004, pp. 206\u2013215 (2004)","DOI":"10.1145\/1014052.1014077"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0164-1212(03)00217-6","volume":"72","author":"S.R. Kirk","year":"2004","unstructured":"Kirk, S.R., Jenkins, S.: Information theory-based software metrics and obfuscation. J. Systems and Software\u00a072, 179\u2013186 (2004)","journal-title":"J. Systems and Software"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1209\/epl\/i2004-10483-y","volume":"70","author":"A. Kraskov","year":"2005","unstructured":"Kraskov, A., St\u00f6gbauer, H., Andrzejak, R.G., Grassberger, P.: Hierarchical clustering using mutual information. Europhys. Lett.\u00a070(2), 278\u2013284 (2005)","journal-title":"Europhys. Lett."},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1093\/bioinformatics\/bti806","volume":"22","author":"A. Kocsor","year":"2006","unstructured":"Kocsor, A., Kertesz-Farkas, A., Kajan, L., Pongor, S.: Application of compression-based distance measures to protein sequence classification: a methodology study. Bioinformatics\u00a022(4), 407\u2013412 (2006)","journal-title":"Bioinformatics"},{"issue":"7","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1093\/bioinformatics\/bth031","volume":"20","author":"N. Krasnogor","year":"2004","unstructured":"Krasnogor, N., Pelta, D.A.: Measuring the similarity of protein structures by means of the universal similarity metric. Bioinformatics\u00a020(7), 1015\u20131021 (2004)","journal-title":"Bioinformatics"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M. Li","year":"2001","unstructured":"Li, M., Badger, J., Chen, X., Kwong, S., Kearney, P., Zhang, H.: An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics\u00a017(2), 149\u2013154 (2001)","journal-title":"Bioinformatics"},{"issue":"12","key":"1_CR19","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M. Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vitanyi, P.M.B.: The similarity metric. IEEE Trans. Information Theory\u00a050(12), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Information Theory"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn., p. 637. Springer, Heidelberg (1997)","edition":"2"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A. Muchnik","year":"2002","unstructured":"Muchnik, A.: Conditional comlexity and codes. Theoretical Computer Science\u00a0271(1), 97\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Muchnik, A., Vereshchagin, N.K.: Logical operations and Kolmogorov complexity II. In: Proc. 16th Conf. Comput. Complexity, pp. 256\u2013265 (2001)","DOI":"10.1109\/CCC.2001.933892"},{"issue":"6","key":"1_CR23","first-page":"2122","volume":"19","author":"H.H. Otu","year":"2003","unstructured":"Otu, H.H., Sayood, K.: Bioinformatics. A new sequence distance measure for phylogenetic tree construction\u00a019(6), 2122\u20132130 (2003)","journal-title":"A new sequence distance measure for phylogenetic tree construction"},{"key":"1_CR24","unstructured":"Pao, H.K., Case, J.: Computing entropy for ortholog detection. In: Int\u2019l Conf. Comput. Intell., Istanbul Turkey, December 17-19 (2004)"},{"key":"1_CR25","unstructured":"Parry, D.: Use of Kolmogorov distance identification of web page authorship, topic and domain. In: Workshop on Open Source Web Inf. Retrieval (2005), http:\/\/www.emse.fr\/OSWIR05\/"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Costa Santos, C., Bernardes, J., Vit\u00e1nyi, P.M.B., Antunes, L.: Clustering fetal heart rate tracings by compression. In: Proc. 19th IEEE Intn\u2019l Symp. Computer-Based Medical Systems, Salt Lake City, Utah, June 22-23 (2006)","DOI":"10.1109\/CBMS.2006.68"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(01)00035-4","volume":"271","author":"A.K. Shen","year":"2002","unstructured":"Shen, A.K., Vereshchagin, N.K.: Logical operations and Kolmogorov complexity. Theoret. Comput. Sci.\u00a0271, 125\u2013129 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR28","unstructured":"Taha, W., Crosby, S., Swadi, K.: A new approach to data mining for software design, Rice Univ. (manuscript, 2006)"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1093\/bioinformatics\/15.3.194","volume":"15","author":"J.S. Varre","year":"1999","unstructured":"Varre, J.S., Delahaye, J.P., Rivals, E.: Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics\u00a015(3), 194\u2013202 (1999)","journal-title":"Bioinformatics"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(01)00036-6","volume":"271","author":"N.K. Vereshchagin","year":"2002","unstructured":"Vereshchagin, N.K., V\u2019yugin, M.V.: Independent minimum length programs to translate between given strings. Theoret. Comput. Sci.\u00a0271, 131\u2013143 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(01)00037-8","volume":"271","author":"M.V. V\u2019yugin","year":"2002","unstructured":"V\u2019yugin, M.V.: Information distance and conditional complexities. Theoret. Comput. Sci.\u00a0271, 145\u2013150 (2002)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T11:04:28Z","timestamp":1736507068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11812128_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}