{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:54Z","timestamp":1725564654915},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153860"},{"type":"electronic","value":"9783642153877"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15387-7_49","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T04:20:39Z","timestamp":1283487639000},"page":"452-460","source":"Crossref","is-referenced-by-count":0,"title":["Clustering Based on Kolmogorov Information"],"prefix":"10.1007","author":[{"given":"Fouchal","family":"Said","sequence":"first","affiliation":[]},{"given":"Ahat","family":"Murat","sequence":"additional","affiliation":[]},{"given":"Lavall\u00e9e","family":"Ivan","sequence":"additional","affiliation":[]},{"given":"Bui","family":"Marc","sequence":"additional","affiliation":[]},{"given":"Benamor","family":"Sofiane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Abrahams, J.: Code and parse trees for lossless source encoding. In: Proceedings of Compression and Complexity of Sequences, vol.\u00a07.1, pp. 198\u2013222 (1997)"},{"issue":"4","key":"49_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., G\u00e0cs, P., Li, M., Vit\u00e0nyi, P.M.B., Zurek, W.: Information Distance. IEEE Transactions on Information Theory\u00a044(4), 1407\u20131423 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"49_CR3","unstructured":"Cilibrasi, R.: Statistical Inference Through Data Compression. Phd thesis, Amsterdam Universtity (2007)"},{"issue":"3","key":"49_CR4","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"R. Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., Vit\u00e0nyi, P.M.B.: The Google Similarity Distance. IEEE Transactions on Knowledge and Data Engineering\u00a019(3), 370\u2013383 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Cilibrasi, R., Vit\u00e0nyi, P.M.B.: Clustering by compression. IEEE Transactions on Information Theory\u00a051(4) (2005)","DOI":"10.1109\/TIT.2005.844059"},{"key":"49_CR6","unstructured":"Cilibrasi, R., Vit\u00e0nyi, P.M.B.: A New Quartet Tree Heuristic for Hierarchical Clustering. In: IEEE\/ACM Trans. Computat. Biol. Bioinf.; Presented at the EU- PASCAL Statistics and Optimization of Clustering Workshop, London, UK (2005) (submitted)"},{"key":"49_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley & Sons, Chichester (1991)"},{"key":"49_CR8","unstructured":"Delahaye, J.P., Zenil, H.: Towards a stable definition of Kolmogorov-Chaitin complexity. Fundamenta informaticae, 1\u201315 (2008)"},{"key":"49_CR9","unstructured":"Delahaye, J.P.: Complexit\u00e9s, Aux limites des math\u00e9matiques et de l\u2019informatique. In: Belin, pour la science (2006)"},{"issue":"6","key":"49_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ipl.2007.07.002","volume":"104","author":"I. Gronau","year":"2007","unstructured":"Gronau, I., Moran, S.: Optimal implementations of UPGMA and other common clustering algorithms. Information Processing Letters\u00a0104(6), 205\u2013210 (2007)","journal-title":"Information Processing Letters"},{"key":"49_CR11","unstructured":"Guindon, S.: M\u00e9thodes et algorithmes pour l\u2019approche statistique en phylog\u00e9nie. Phd thesis, Universit\u00e9 Montpellier II (2003)"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A method for the construction of minimum redundancy codes. In: Proceeding of the IRE, pp. 1098\u20131101 (1951)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"49_CR13","unstructured":"Lavall\u00e9e, I.: Complexit\u00e9 et algorithmique avanc\u00e9e \u201cune introduction\u201d. In: 2 \u00e9me \u00e9dition Hermann \u00e9diteurs (2008)"},{"key":"49_CR14","first-page":"198","volume":"7.1","author":"V. Levorato","year":"2009","unstructured":"Levorato, V., Le, T.V., Lamure, M., Bui, M.: Classification pr\u00e9topologique bas\u00e9e sur la complexit\u00e9 de Kolmogorov. Studia Informatica\u00a07.1, 198\u2013222 (2009)","journal-title":"Studia Informatica"},{"key":"49_CR15","unstructured":"Levorato, V.: Contributions \u00e0 la Mod\u00e9lisation des R\u00e9seaux Complexes: Pr\u00e9topologie et Applications. Phd thesis, Universit\u00e9 de Paris 8, Paris (2008)"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Loewenstein, Y., Portugaly, E., Former, M.L., Linial, M.: Effecient algorithms for accurate hierarchical clustering of huge datasets: tacking the entire protein space. Bioinformatics, 145\u2013171 (2008)","DOI":"10.1093\/bioinformatics\/btn174"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e0nyi, P.M.B.: The similarity metric. IEEE Transactions on Information Theory\u00a050(12) (2007)","DOI":"10.1109\/TIT.2004.838101"},{"key":"49_CR18","doi-asserted-by":"crossref","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., Vit\u00e0nyi, P.M.B.: An introduction to Kolmogorov Complexity and its applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"issue":"2","key":"49_CR19","first-page":"101","volume":"1","author":"F. Murtagh","year":"1984","unstructured":"Murtagh, F.: Complexities of hierarchic clustering algorithms: State of art. Computational Statistics Quarterly\u00a01(2), 101\u2013113 (1984)","journal-title":"Computational Statistics Quarterly"},{"key":"49_CR20","unstructured":"Salemi, M., Vandamme, A.M.: The phylogenetic handbook: a practical approach to DNA and protein phylogeny. The Press Syndicate of the University of cambridge (2003)"},{"issue":"3","key":"49_CR21","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1093\/bioinformatics\/15.3.194","volume":"15","author":"J.S. Varr\u00e9","year":"1998","unstructured":"Varr\u00e9, J.S., Delahaye, J.P., Rivals, E.: Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics\u00a015(3), 194\u2013202 (1998)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15387-7_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:06:24Z","timestamp":1606169184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15387-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153860","9783642153877"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15387-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}