{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:10:09Z","timestamp":1747177809889,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453205"},{"type":"electronic","value":"9783642453212"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45321-2_10","type":"book-chapter","created":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T13:48:50Z","timestamp":1417614530000},"page":"197-212","source":"Crossref","is-referenced-by-count":0,"title":["A New Approach to Alphabet Extension for Improving Static Compression Schemes"],"prefix":"10.1007","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Arnold, R., Bell, T.: A corpus for the evaluation of lossless compression algorithms. In: Proc. Data Compression Conference DCC 1997, Snowbird, Utah, pp. 201\u2013210 (1997)","DOI":"10.1109\/DCC.1997.582019"},{"key":"10_CR2","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-82456-2","volume-title":"The myriad virtues of subword trees, Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees, Combinatorial Algorithms on Words. NATO ASI Series, vol.\u00a0F12, pp. 85\u201396. Springer, Berlin (1985)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Lonardi, S.: Some theory and practice of greedy off-line textual substitution. In: Proc. Data Compression Conference DCC 1998, Snowbird, Utah, pp. 119\u2013128 (1998)","DOI":"10.1109\/DCC.1998.672138"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/5.892709","volume":"88","author":"A. Apostolico","year":"2000","unstructured":"Apostolico, A., Lonardi, S.: Off-line compression by greedy textual substitution. Proc. of the IEEE\u00a088, 1733\u20131744 (2000)","journal-title":"Proc. of the IEEE"},{"key":"10_CR5","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"10_CR6","volume-title":"Text Compression","author":"T.C. Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.A.: Text Compression. Prentice Hall, Englewood Cliffs (1990)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/76894.76896","volume":"21","author":"T. Bell","year":"1989","unstructured":"Bell, T., Witten, I.H., Cleary, J.G.: Modeling for Text Compression. ACM Computing Surveys\u00a021, 557\u2013591 (1989)","journal-title":"ACM Computing Surveys"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bentley, J., McIlroy, D.: Data compression using long common strings. In: Proc. Data Compression Conference, DCC 1999, Snowbird, Utah, pp. 287\u2013295 (1999)","DOI":"10.1109\/DCC.1999.755678"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/78915.78917","volume":"8","author":"A. Bookstein","year":"1990","unstructured":"Bookstein, A., Klein, S.T.: Compression, Information Theory and Grammars: A Unified Approach. ACM Trans. on Information Systems\u00a08, 27\u201349 (1990)","journal-title":"ACM Trans. on Information Systems"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/S0306-4573(97)00034-4","volume":"33","author":"A. Bookstein","year":"1997","unstructured":"Bookstein, A., Klein, S.T., Raita, T.: An overhead reduction technique for mega-state compression schemes. Information Processing & Management\u00a033, 745\u2013760 (1997)","journal-title":"Information Processing & Management"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/0306-4573(92)90069-C","volume":"28","author":"A. Bookstein","year":"1992","unstructured":"Bookstein, A., Klein, S.T., Ziff, D.A.: A systematic approach to compressing a full text retrieval system. Information Processing & Management\u00a028, 795\u2013806 (1992)","journal-title":"Information Processing & Management"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-39984-1_10","volume-title":"String Processing and Information Retrieval","author":"N.R. Brisaboa","year":"2003","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Esteller, M.F. (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 122\u2013136. Springer, Heidelberg (2003)"},{"issue":"5","key":"10_CR13","first-page":"430","volume":"52","author":"A. Cannane","year":"2001","unstructured":"Cannane, A., Williams, H.E.: General-purpose compression for efficient retrieval. Journal of the ASIS\u00a052(5), 430\u2013437 (2001)","journal-title":"Journal of the ASIS"},{"issue":"4","key":"10_CR14","first-page":"22","volume":"14","author":"Y. Choueka","year":"1989","unstructured":"Choueka, Y.: Responsa: A full-text retrieval system with linguistic processing for a 65-million word corpus of jewish heritage in Hebrew. IEEE Data Eng. Bull.\u00a014(4), 22\u201331 (1989)","journal-title":"IEEE Data Eng. Bull."},{"key":"10_CR15","unstructured":"Even, S.: Graph Algorithms. Computer Science Press (1979)"},{"key":"10_CR16","first-page":"149","volume":"16","author":"A.S. Fraenkel","year":"1976","unstructured":"Fraenkel, A.S.: All about the Responsa Retrieval Project you always wanted to know but were afraid to ask. Expanded Summary, Jurimetrics J.\u00a016, 149\u2013156 (1976)","journal-title":"Expanded Summary, Jurimetrics J."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/spe.4380190207","volume":"19","author":"A. Moffat","year":"1989","unstructured":"Moffat, A.: Word-based text compression. Software \u2013 Practice & Experience\u00a019, 185\u2013198 (1989)","journal-title":"Software \u2013 Practice & Experience"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF00264280","volume":"20","author":"A.S. Fraenkel","year":"1983","unstructured":"Fraenkel, A.S., Mor, M., Perl, Y.: Is text compression by prefixes and suffixes practical? Acta Informatica\u00a020, 371\u2013389 (1983)","journal-title":"Acta Informatica"},{"key":"10_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Halldorsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded degree graphs. In: Proc. 26th ACM-STOC, pp. 439\u2013448 (1994)","DOI":"10.1145\/195058.195221"},{"key":"10_CR21","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1997)"},{"key":"10_CR22","first-page":"7","volume":"3","author":"S.T. Klein","year":"2000","unstructured":"Klein, S.T.: Skeleton trees for the efficient decoding of Huffman encoded texts. The Special issue on Compression and Efficiency in Information Retrieval of the Kluwer Journal of Information Retrieval\u00a03, 7\u201323 (2000)","journal-title":"The Special issue on Compression and Efficiency in Information Retrieval of the Kluwer Journal of Information Retrieval"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/comjnl\/40.2_and_3.117","volume":"40","author":"S.T. Klein","year":"1997","unstructured":"Klein, S.T.: Efficient optimal recompression. The Computer Journal\u00a040, 117\u2013126 (1997)","journal-title":"The Computer Journal"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1093\/comjnl\/bxp046","volume":"53","author":"S.T. Klein","year":"2010","unstructured":"Klein, S.T., Kopel Ben-Nissan, M.: On the Usefulness of Fibonacci Compression Codes. The Computer Journal\u00a053, 701\u2013716 (2010)","journal-title":"The Computer Journal"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: On choosing dense subgraphs. In: Proc. 34th FOCS, Palo-Alto, CA, pp. 692\u2013701 (1993)","DOI":"10.1109\/SFCS.1993.366818"},{"issue":"11","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"N.J. Larson","year":"2000","unstructured":"Larson, N.J., Moffat, A.: Offline dicionary based compression. Proceedings of the IEEE\u00a088(11), 1722\u20131732 (2000)","journal-title":"Proceedings of the IEEE"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/TIT.1982.1056452","volume":"IT\u201328","author":"G. Longo","year":"1982","unstructured":"Longo, G., Galasso, G.: An application of informational divergence to Huffman codes. IEEE Trans. on Inf. Th.\u00a0IT\u201328, 36\u201343 (1982)","journal-title":"IEEE Trans. on Inf. Th."},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E.S. Moura de","year":"2000","unstructured":"de Moura, E.S., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Trans. on Information Systems\u00a018, 113\u2013139 (2000)","journal-title":"ACM Trans. on Information Systems"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","volume":"IT\u201327","author":"J. Rissanen","year":"1981","unstructured":"Rissanen, J., Langdon, G.G.: Universal modeling and coding. IEEE Trans. on Inf. Th.\u00a0IT\u201327, 12\u201323 (1981)","journal-title":"IEEE Trans. on Inf. Th."},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J.A. Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM\u00a029, 928\u2013951 (1982)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR31","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"10_CR32","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1994","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York (1994)"}],"container-title":["Lecture Notes in Computer Science","Language, Culture, Computation. Computing - Theory and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45321-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:49:13Z","timestamp":1747176553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45321-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642453205","9783642453212"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45321-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}