{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:01:18Z","timestamp":1648990878798},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0304-3975(97)00275-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"261-287","source":"Crossref","is-referenced-by-count":0,"title":["Optimal representation in average using Kolmogorov complexity"],"prefix":"10.1016","volume":"200","author":[{"given":"E.","family":"Rivals","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.P.","family":"Delahaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00275-2_BIB1","series-title":"Text Compression","author":"Bell","year":"1990"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB2","series-title":"Information and Randomness: an Algorithmic Perspective","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB3","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049763.ch73","article-title":"Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB4","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB5","series-title":"Information, complexit\u00e9 et hasard","author":"Delahaye","year":"1994"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB6","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0220034","article-title":"Compression and Ranking","volume":"20","author":"Goldberg","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00275-2_BIB7","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"vol. 40","author":"Huffman","year":"1952"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB8","series-title":"Introduction to Kolmogorov Complexity and Its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB9","series-title":"Intelligent Systems for Molecular Biology","first-page":"284","article-title":"Discovering sequence similarity by the algorithmic significance","author":"Milosavljevic\u0300","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(97)00275-2_BIB10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0300-9084(96)84763-8","article-title":"Compression and genetic sequences analysis","volume":"78","author":"Rivals","year":"1996","journal-title":"Biochimie"},{"issue":"2","key":"10.1016\/S0304-3975(97)00275-2_BIB11","first-page":"131","article-title":"Detection of significant patterns by compression algorithms: the case of Approximate Tandem Repeats in DNA sequences","volume":"13","author":"Rivals","year":"1997","journal-title":"CABIOS"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB12_1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communications","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(97)00275-2_BIB12_2","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","article-title":"A mathematical theory of communications","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(97)00275-2_BIB13","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB14","series-title":"Kolmogorov Complexity and Computational Complexity","author":"Watanabe","year":"1992"},{"key":"10.1016\/S0304-3975(97)00275-2_BIB15","series-title":"Information Theory and Molecular Biology","author":"Yockey","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002752?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002752?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:38Z","timestamp":1556315918000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0304397597002752"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00275-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}