{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:20Z","timestamp":1775281220768,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676331","type":"print"},{"value":"9783540451235","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45123-4_19","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:59:14Z","timestamp":1194965954000},"page":"210-221","source":"Crossref","is-referenced-by-count":3,"title":["Improving Static Compression Schemes by Alphabet Extension"],"prefix":"10.1007","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"key":"19_CR1","series-title":"NATO ASI Series","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Appostolico","year":"1985","unstructured":"Appostolico A., The myriad virtues of subword trees, Combinatorial Algorithms on Words, NATO ASI Series Vol F12, Springer Verlag, Berlin (1985) 85\u201396."},{"key":"19_CR2","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, MA (1974)."},{"key":"19_CR3","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, NJ (1990)."},{"key":"19_CR4","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 8 (1990) 27\u201349.","journal-title":"ACM Trans. on Information Systems"},{"key":"19_CR5","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 megastate compression schemes, Information Processing & Management33 (1997) 745\u2013760.","journal-title":"Information Processing & Management"},{"key":"19_CR6","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 & Management28 (1992) 795\u2013806.","journal-title":"Information Processing & Management"},{"key":"19_CR7","unstructured":"Even S., Graph Algorithms, Computer Science Press (1979)."},{"key":"19_CR8","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.16 (1976) 149\u2013156.","journal-title":"Jurimetrics J."},{"key":"19_CR9","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 Informatica20 (1983) 371\u2013389.","journal-title":"Acta Informatica"},{"key":"19_CR10","volume-title":"Computers and Intractability: A Guidetothe Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S., Computers and Intractability: A Guidetothe Theory of NP-Completeness, W.H. Freeman, San Francisco (1979)."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Halldorsson M.M., Radhakrishnan J., Greed is good: approximating independent sets in sparse and bounded degree graphs, Proc. 26th ACM-STOC (1994) 439\u2013448.","DOI":"10.1145\/195058.195221"},{"key":"19_CR12","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":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-63220-4_50","volume-title":"Proc. 8th Symp. on Combinatorial Pattern Matching","author":"S.T. Klein","year":"1997","unstructured":"Klein S.T., Space and time-efficient decoding with canonical Huffman trees, Proc. 8th Symp. on Combinatorial Pattern Matching, Aarhus, Denmark, Lecture Notes in Computer Science1264, Springer Verlag, Berlin (1997) 65\u201375."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight E.M., A space economical suffix tree construction algorithm, Journal of the ACM23 (1976) 262\u2013272.","journal-title":"Journal of the ACM"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Kortsarz G., Peleg D., On choosing dense subgraphs, Proc. 34th FOCS, Palo-Alto, CA (1993) 692\u2013701.","DOI":"10.1109\/SFCS.1993.366818"},{"key":"19_CR16","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. ACM29 (1982) 928\u2013951.","journal-title":"J. ACM"},{"key":"19_CR17","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45123-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T01:32:27Z","timestamp":1551058347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45123-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676331","9783540451235"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45123-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}