{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:10Z","timestamp":1746115870354,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449574"},{"type":"electronic","value":"9783642449581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44958-1_4","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T14:54:01Z","timestamp":1382453641000},"page":"55-64","source":"Crossref","is-referenced-by-count":0,"title":["Partial Match Distance"],"prefix":"10.1007","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_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":"4_CR2","doi-asserted-by":"crossref","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":"4_CR3","doi-asserted-by":"crossref","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"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers. Journal of the ACM\u00a016(3), 407","DOI":"10.1145\/321526.321530"},{"issue":"7","key":"4_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":"4_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.A., Romashchenko, A.E., Shen, A.K., Vereshchagin, N.K.: Upper semi-lattice of binary strings with the relation \u201cx is simple conditional to y\u201d. Theoret. Comput. Sci.\u00a0271, 69\u201395 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_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 Algorithmic, R.: clustring of music based on string compression. Comput. Music J.\u00a028(4), 49\u201367 (2004)","journal-title":"Comput. Music J."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"R. Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: The Google similarity distance. IEEE Trans. Knowledge and Data Engineering\u00a019(3), 370\u2013383 (2007)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"4","key":"4_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":"4_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"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1008023416823","volume":"28","author":"R. Fagin","year":"1998","unstructured":"Fagin, R., Stockmeyer, L.: Relaxing the triangle inequality in pattern matching. Int\u2019l J. Comput. Vision\u00a028(3), 219\u2013231 (1998)","journal-title":"Int\u2019l J. Comput. Vision"},{"key":"4_CR12","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":"4_CR13","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-baed software metrics and obfuscation. J. Systems and Software\u00a072, 179\u2013186 (2004)","journal-title":"J. Systems and Software"},{"issue":"1","key":"4_CR14","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three Approaches to the Quantitative Definition of Information. Problems Inform. Transmission\u00a01(1), 1\u20137 (1965)","journal-title":"Problems Inform. Transmission"},{"issue":"2","key":"4_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":"4_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":"4_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":"4_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":"4_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"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054107004905","volume":"18","author":"M. Li","year":"2007","unstructured":"Li, M.: Information distance and its applications. Int\u2019l J. Found. Comput. Sci.\u00a018(4), 669\u2013681 (2007)","journal-title":"Int\u2019l J. Found. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A.A. Muchnik","year":"2002","unstructured":"Muchnik, A.A.: Conditional comlexity and codes. Theoretical Computer Science\u00a0271(1), 97\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Muchnik, A.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"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Nykter, M., Price, N.D., Larjo, A., Aho, T., Kauffman, S.A., Yli-Harja, O., Shmulevich, I.: Critical networks exhibit maximal information diversity in structure-dynamics relationships. Phy. Rev. Lett.\u00a0100, 058702(4) (2008)","DOI":"10.1103\/PhysRevLett.100.058702"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1073\/pnas.0711525105","volume":"105","author":"M. Nykter","year":"2008","unstructured":"Nykter, M., Price, N.D., Aldana, M., Ramsey, S.A., Kauffman, S.A., Hood, L.E., Yli-Harja, O., Shmulevich, I.: Gene expression dynamics in the macrophage exhibit criticality. Proc. Nat. Acad. Sci. USA\u00a0105(6), 1897\u20131900 (2008)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"issue":"6","key":"4_CR26","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1093\/bioinformatics\/btg295","volume":"19","author":"H.H. Otu","year":"2003","unstructured":"Otu, H.H., Sayood, K.: Bioinformatics\u00a019(6), 2122\u20132130 (2003); A new sequence distance measure for phylogenetic tree construction","journal-title":"Bioinformatics"},{"key":"4_CR27","unstructured":"Pao, H.K., Case, J.: Computing entropy for ortholog detection. In: Int\u2019l Conf. Comput. Intell., Istanbul, Turkey, December 17-19 (2004)"},{"key":"4_CR28","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":"4_CR29","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":"4_CR30","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."},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A Formal Theory of Inductive Inference, Part I. d Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"d Information and Control"},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A Formal Theory of Inductive Inference, Part II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"3","key":"4_CR33","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":"4_CR34","doi-asserted-by":"crossref","unstructured":"Veltkamp, R.C.: Shape Matching: Similarity Measures and Algorithms, invited talk. In: Proc. Int\u2019l Conf. Shape Modeling Applications 2001, Italy, pp. 188\u2013197 (2001)","DOI":"10.1109\/SMA.2001.923389"},{"key":"4_CR35","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":"4_CR36","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."},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Wallace, C.S., Dowe, D.L.: Minimum Message Length and Kolmogorov Complexity. Computer Journal\u00a042(4) (1999)","DOI":"10.1093\/comjnl\/42.4.270"},{"key":"4_CR38","unstructured":"Yang, T., Wang, D., Zhu, X., Li, M.: Information distance between what I said and what it heard. Manuscript in preparation (August. 2011)"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Zhang, X., Hao, Y., Zhu, X., Li, M.: Information distance from a question to an answer. In: Proc. 13th ACM SIGKDD, August 12-15, pp. 874\u2013883 (2007)","DOI":"10.1145\/1281192.1281285"},{"issue":"4","key":"4_CR40","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s11390-008-9152-9","volume":"23","author":"X. Zhang","year":"2008","unstructured":"Zhang, X., Hao, Y., Zhu, X., Li, M.: New information measure and its application in question answering system. J. Comput. Sci. Tech.\u00a023(4), 557\u2013572 (2008)","journal-title":"J. Comput. Sci. Tech."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44958-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:51:30Z","timestamp":1746035490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}