{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:42:28Z","timestamp":1750268548219},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing & Management"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0306-4573(92)90068-b","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"781-793","source":"Crossref","is-referenced-by-count":9,"title":["Compression of parallel texts"],"prefix":"10.1016","volume":"28","author":[{"given":"Craig","family":"Nevill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"Bell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4573(92)90068-B_BIB1","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/76894.76896","article-title":"Modelling for text compression","volume":"21","author":"Bell","year":"1989","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0306-4573(92)90068-B_BIB2","series-title":"Text compression","author":"Bell","year":"1990"},{"key":"10.1016\/0306-4573(92)90068-B_BIB3","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TIT.1984.1056889","article-title":"A comparison of enumerative and adaptive codes","volume":"IT-30","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90068-B_BIB4","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data compression using adaptive coding and partial string matching","volume":"COM-32","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Communications"},{"key":"10.1016\/0306-4573(92)90068-B_BIB5","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TIT.1978.1055912","article-title":"A convergent gambling estimate of the entropy of English","volume":"IT-24","author":"Cover","year":"1978","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90068-B_BIB6","first-page":"1098","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0306-4573(92)90068-B_BIB7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/45072.45074","article-title":"Data compression","volume":"19","author":"Lelewer","year":"1987","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0306-4573(92)90068-B_BIB8","series-title":"Research Report 88\/7","article-title":"A note on the PPM data compression algorithm","author":"Moffat","year":"1988"},{"key":"10.1016\/0306-4573(92)90068-B_BIB9","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/0306-4573(92)90068-B_BIB10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/j.1538-7305.1951.tb01366.x","article-title":"Prediction and entropy of printed English","author":"Shannon","year":"1951","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/0306-4573(92)90068-B_BIB11","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Communications of the Association for Computing Machinery"},{"key":"10.1016\/0306-4573(92)90068-B_BIB12","series-title":"An information-theoretical metric for testing program comprehension","author":"Zunde","year":"1985"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030645739290068B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030645739290068B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T05:24:26Z","timestamp":1554873866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030645739290068B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["030645739290068B"],"URL":"https:\/\/doi.org\/10.1016\/0306-4573(92)90068-b","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}