{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:45:10Z","timestamp":1729662310891,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.23919\/eusipco.2017.8081326","type":"proceedings-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T21:20:38Z","timestamp":1509657638000},"page":"843-847","source":"Crossref","is-referenced-by-count":0,"title":["Clustering and causality inference using algorithmic complexity"],"prefix":"10.23919","author":[{"given":"Marion","family":"Revolle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francois","family":"Cayre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Le Bihan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803161"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/1912791"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e15010113"},{"key":"ref14","first-page":"406","article-title":"The Neighbor-Joining Method: A New Method for Reconstructing Phylogenie Trees","volume":"4","author":"saitou","year":"1987","journal-title":"Molecular Biology and Evolution"},{"journal-title":"La Réticence","year":"1991","author":"toussaint","key":"ref15"},{"key":"ref16","first-page":"1409","article-title":"A Statistical Method for Evaluating Systematic Relationships","volume":"38","author":"sokal","year":"1958","journal-title":"University of Kansas Science Bulletin"},{"journal-title":"7z format","year":"0","author":"pavlov","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1951"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.243444"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4310\/CIS.2005.v5.n4.a1","article-title":"Common Pitfalls Using the Normalized Compression Distance: What to Watch Out for in a Compressor","volume":"5","author":"cebri\u00e1n","year":"2005","journal-title":"Communications in Information and Systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055501"},{"key":"ref7","article-title":"SALZA: Soft Algorithmic Complexity Estimates for Clustering and Causality Inference","author":"revelle","year":"2016","journal-title":"DRAFT"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.681318"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838101"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"}],"event":{"name":"2017 25th European Signal Processing Conference (EUSIPCO)","start":{"date-parts":[[2017,8,28]]},"location":"Kos, Greece","end":{"date-parts":[[2017,9,2]]}},"container-title":["2017 25th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8067434\/8081145\/08081326.pdf?arnumber=8081326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T14:07:20Z","timestamp":1570284440000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8081326\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.23919\/eusipco.2017.8081326","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}