{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:38:54Z","timestamp":1759963134627},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":[[1978,1]]},"DOI":"10.1016\/0306-4573(78)90067-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"97-106","source":"Crossref","is-referenced-by-count":6,"title":["Selection of prefix and postfix word fragments for data compression"],"prefix":"10.1016","volume":"14","author":[{"given":"T.","family":"Radhakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4573(78)90067-5_BIB1","first-page":"453","article-title":"A classification of compression methods and their usefulness for a large data processing center","volume":"44","author":"Gotlieb","year":"1975","journal-title":"National Comp. Conference"},{"key":"10.1016\/0306-4573(78)90067-5_BIB2","series-title":"Presented in the Conference on Large Data Bases Sponsored by the NAS\/NRC","article-title":"Data compression of large document data bases","author":"Heaps","year":"1974"},{"key":"10.1016\/0306-4573(78)90067-5_BIB3","series-title":"International Computing Symposium","first-page":"511","article-title":"Automatic file compression","author":"McCarthy","year":"1973"},{"key":"10.1016\/0306-4573(78)90067-5_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1021\/c160032a011","article-title":"Use of word fragments in computer based retrieval systems","volume":"9","author":"Columbo","year":"1969","journal-title":"J. Chem. Docum."},{"key":"10.1016\/0306-4573(78)90067-5_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0271(73)90089-2","article-title":"Compression of bibliographic files using an adoption of run-length coding","volume":"3","author":"Lynch","year":"1973","journal-title":"Inform. Stor. Retr."},{"key":"10.1016\/0306-4573(78)90067-5_BIB6","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"key":"10.1016\/0306-4573(78)90067-5_BIB7","first-page":"129","article-title":"Compaction of names by X-grams","volume":"6","author":"Walker","year":"1969","journal-title":"Proc. Am. Soc. Inform. Sci."},{"key":"10.1016\/0306-4573(78)90067-5_BIB8","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/0020-0271(73)90011-9","article-title":"Selection of equifrequent word fragments for information retrieval","volume":"9","author":"Schuegraf","year":"1973","journal-title":"Inform. Stor. Retr."},{"key":"10.1016\/0306-4573(78)90067-5_BIB9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/361972.361982","article-title":"Common phrases and minimum-space text storage","volume":"16","author":"Wagner","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4573(78)90067-5_BIB10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/spe.4380070109","article-title":"Compaction of diagnostic messages for compilers","volume":"7","author":"Heaps","year":"1977","journal-title":"Software-Practice and Experience"},{"key":"10.1016\/0306-4573(78)90067-5_BIB11","article-title":"Fundamental algorithms","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4573(78)90067-5_BIB12","first-page":"47","article-title":"Storage analysis of a compression coding for document data bases","volume":"10","author":"Heaps","year":"1972","journal-title":"Infor."},{"key":"10.1016\/0306-4573(78)90067-5_BIB13","article-title":"Sorting and searching","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4573(78)90067-5_BIB14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in string","volume":"6","author":"Knuth","year":"1977","journal-title":"Siam J. Computing"},{"key":"10.1016\/0306-4573(78)90067-5_BIB15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to biblographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4573(78)90067-5_BIB16","series-title":"Computational Analysis of Present-Day American English","author":"Kuc\u011bra","year":"1967"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457378900675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457378900675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T08:58:02Z","timestamp":1554886682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306457378900675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["0306457378900675"],"URL":"https:\/\/doi.org\/10.1016\/0306-4573(78)90067-5","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}