{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:50:26Z","timestamp":1762210226950,"version":"3.30.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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 Sciences"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0020-0255(99)00060-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"57-72","source":"Crossref","is-referenced-by-count":7,"title":["Dictionary selection using partial matching"],"prefix":"10.1016","volume":"119","author":[{"given":"Dzung T.","family":"Hoang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1990","series-title":"Text Compression","author":"Bell","key":"10.1016\/S0020-0255(99)00060-2_BIB1"},{"issue":"4","key":"10.1016\/S0020-0255(99)00060-2_BIB2","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1145\/179812.179892","article-title":"Relationship between greedy parsing and symbol-wise text compression","volume":"41","author":"Bell","year":"1994","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB3","doi-asserted-by":"crossref","unstructured":"C. Bloom, Using prediction to improve LZ77 coders, in: Proceedings of of 1996 IEEE Data Compression Conference, 1996, p. 425 (full version available at http:\/\/wwwvms.utexas.edu\/ cbloom\/dcc96.html)","DOI":"10.1109\/DCC.1996.488353"},{"issue":"4","key":"10.1016\/S0020-0255(99)00060-2_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":"32","author":"Cleary","year":"1984","journal-title":"IEEE Transactions on Communication COMM"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB5","doi-asserted-by":"crossref","unstructured":"J.G. Cleary, W.J. Teahan, I.H. Witten, Unbounded length contexts for PPM, in: Proceedings of the 1995 Data Compression Conference, 1995, pp. 52\u201361","DOI":"10.1109\/DCC.1995.515495"},{"issue":"4","key":"10.1016\/S0020-0255(99)00060-2_BIB6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/63334.63341","article-title":"Data compression with finite windows","volume":"32","author":"Fiala","year":"1989","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB7","doi-asserted-by":"crossref","unstructured":"P.C. Gutmann, T.C. Bell, A hybrid approach to data compression, in: Proceedings of the 1994 Data Compression Conference, Snowbird, UT, March 1994, IEEE Computer Society Press, pp. 225\u2013233","DOI":"10.1109\/DCC.1994.305930"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB8","doi-asserted-by":"crossref","unstructured":"D.T. Hoang, P.M. Long, J.S. Vitter, Multiple-dictionary compression using partial matching, in: Proceedings of the 1995 IEEE Data Compression Conference, Snowbird, Utah, March 1995, pp. 272\u2013281","DOI":"10.1109\/DCC.1995.515517"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB9","series-title":"Images and Text Compression","first-page":"85","article-title":"Practical implementations of arithmetic coding","author":"Howard","year":"1992"},{"issue":"6","key":"10.1016\/S0020-0255(99)00060-2_BIB10","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/0306-4573(94)90006-X","article-title":"Design and analysis of fast text compression based on quasi-arithmetic coding","volume":"30","author":"Howard","year":"1994","journal-title":"Information Processing and Management"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1983.1056645","article-title":"A note on the Ziv\u2013Lempel model for compressing individual sequences","volume":"IT-29","author":"Langdon","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB12","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1147\/rd.326.0727","article-title":"Optimal hardware and software arithmetic coding procedures for the Q-coder","volume":"32","author":"Mitchell","year":"1988","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB13","doi-asserted-by":"crossref","unstructured":"A. Moffat, R. Neal, I.H. Witten, Arithmetic coding revisited, in: Proceedings of the 1995 Data Compression Conference, 1995, pp. 202\u2013211","DOI":"10.1109\/DCC.1995.515510"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB14","doi-asserted-by":"crossref","unstructured":"Y. Nakano, H. Yahagi, Y. Okada, S. Yoshida, Highly efficient universal coding with classifying to subdictionaries for text compression, in: Proceedings of the 1994 Data Compression Conference, Snowbird, UT, March 1994. IEEE Computer Society Press, pp. 234\u2013243","DOI":"10.1109\/DCC.1994.305931"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB15","unstructured":"M. Slyz, Image compression using a Ziv\u2013Lempel type coder, Master's thesis, School of Engineering, University of Michigan, 1991"},{"year":"1988","series-title":"Data Compression: Methods and Theory","author":"Storer","key":"10.1016\/S0020-0255(99)00060-2_BIB16"},{"year":"1982","series-title":"Estimation of Dependencies based on Empirical Data","author":"Vapnik","key":"10.1016\/S0020-0255(99)00060-2_BIB17"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB18","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"IEEE Computer"},{"issue":"3","key":"10.1016\/S0020-0255(99)00060-2_BIB19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"IT-23","author":"Ziv","year":"1977","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S0020-0255(99)00060-2_BIB20","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Transactions on Information Theory IT"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T22:12:51Z","timestamp":1733350371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0020025599000602"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00060-2","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}