{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:44:40Z","timestamp":1648532680505},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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 Letters"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00066-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:07:29Z","timestamp":1027595249000},"page":"91-96","source":"Crossref","is-referenced-by-count":2,"title":["On-line longest fragment first parsing algorithm"],"prefix":"10.1016","volume":"59","author":[{"given":"Hideo","family":"Nagumo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mi","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karan","family":"Watson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00066-X_BIB1","series-title":"Text Compression","author":"Bell","year":"1990"},{"key":"10.1016\/0020-0190(96)00066-X_BIB2","series-title":"Proc. IEEE Data Compression Conf.","first-page":"52","article-title":"Parallel algorithms for optimal compression using dictionaries with the prefix property","author":"De Agostino","year":"1992"},{"key":"10.1016\/0020-0190(96)00066-X_BIB3","series-title":"Proc. IEEE Data Compression Conf.","first-page":"162","article-title":"Parallel algorithms for the static dictionary compression","author":"Nagumo","year":"1995"},{"key":"10.1016\/0020-0190(96)00066-X_BIB4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0271(74)90069-2","article-title":"A comparison of algorithms for data base compression by use of fragments as language elements","volume":"10","author":"Schuegraf","year":"1974","journal-title":"Information Storage and Retrieval"},{"key":"10.1016\/0020-0190(96)00066-X_BIB5","series-title":"Proc. 8th Internat. Parallel Processing Symp.","first-page":"344","article-title":"PRAM algorithms for static dictionary compression","author":"Stauffer","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909600066X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909600066X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:54:27Z","timestamp":1556362467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909600066X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["002001909600066X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00066-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}