{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:55:04Z","timestamp":1648799704639},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf02238290","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T12:39:14Z","timestamp":1131971954000},"page":"29-46","source":"Crossref","is-referenced-by-count":4,"title":["The fractional greedy algorithm for data compression"],"prefix":"10.1007","volume":"56","author":[{"given":"J.","family":"B\u00e9k\u00e9si","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238290_CR1","volume-title":"Greedy algorithms for on-line data compression","author":"J. B\u00e9k\u00e9si","year":"1993","unstructured":"B\u00e9k\u00e9si, J., Galambos G., Pferschy, U., Woeginger, G. J.: Greedy algorithms for on-line data compression. Report 276-93, Mathematical Institute, TU Graz, Austria 1993."},{"key":"BF02238290_CR2","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/3149.3152","volume":"32","author":"M. E. Gonzalez-Smith","year":"1985","unstructured":"Gonzalez-Smith, M. E., Storer, J. A.: Parallel algorithms for data compression. J. ACM32, 344\u2013373 (1985).","journal-title":"J. ACM"},{"key":"BF02238290_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/128749.128751","volume":"39","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Raita, T.: An analysis of the longest matching and the greedy heuristic in text encoding. J. ACM39, 281\u2013294 (1992).","journal-title":"J. ACM"},{"key":"BF02238290_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0271(74)90069-2","volume":"10","author":"E. J. Schuegraf","year":"1974","unstructured":"Schuegraf, E. J., Heaps, H. S.: A comparison of algorithms for data base compression by use of fragments as language elements. Inf. Stor. Ret.10, 309\u2013319 (1974).","journal-title":"Inf. Stor. Ret."},{"key":"BF02238290_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory23, 337\u2013343 (1977).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238290.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238290\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:02:28Z","timestamp":1557925348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF02238290"],"URL":"https:\/\/doi.org\/10.1007\/bf02238290","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}