{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:12Z","timestamp":1773377592368,"version":"3.50.1"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849610","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2454-2458","source":"Crossref","is-referenced-by-count":1,"title":["Complexity and Similarity for Sequences using LZ77-based conditional information measure"],"prefix":"10.1109","author":[{"given":"Fran\u00e7ois","family":"Cayre","sequence":"first","affiliation":[{"name":"CNRS, Grenoble INP: Institute of Engineering, Univ. Grenoble Alpes, Grenoble, 38000, France"}]},{"given":"Nicolas Le","family":"Bihan","sequence":"additional","affiliation":[{"name":"CNRS, Grenoble INP: Institute of Engineering, Univ. Grenoble Alpes, Grenoble, 38000, France"}]}],"member":"263","reference":[{"key":"ref4","first-page":"464","article-title":"Causal Markov Condition for Submodular Information Measures","author":"steudel","year":"2010","journal-title":"Proc 23rd Annu Conf Learn Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2748-9"},{"key":"ref5","article-title":"SALZA: Practical Algorithmic Information Theory and Sharper Universal String Similarity","author":"revolle","year":"2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.243444"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844059"},{"key":"ref1","article-title":"Vit&#x00E1;niy","author":"li","year":"2008","journal-title":"An Introduction to Kolmogorov Complexity and Its Applications"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849610.pdf?arnumber=8849610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:31Z","timestamp":1773347671000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849610","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}