{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:19:17Z","timestamp":1725520757967},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540890966"},{"type":"electronic","value":"9783540890973"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89097-3_6","type":"book-chapter","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T11:16:29Z","timestamp":1226315789000},"page":"39-50","source":"Crossref","is-referenced-by-count":7,"title":["Improved Variable-to-Fixed Length Codes"],"prefix":"10.1007","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.4310\/CIS.2001.v1.n2.a1","volume":"1","author":"J. Abrahams","year":"2001","unstructured":"Abrahams, J.: Code and parse trees for lossless source encoding. Comm. in Information and Systems\u00a01(2), 113\u2013146 (2001)","journal-title":"Comm. in Information and Systems"},{"key":"6_CR2","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)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-36618-0_33","volume-title":"Advances in Information Retrieval","author":"N.R. Brisaboa","year":"2003","unstructured":"Brisaboa, N.R., Iglesias, E.L., Navarro, G., Param\u00e1, J.R.: An efficient compression code for text databases. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol.\u00a02633, pp. 468\u2013481. Springer, Heidelberg (2003)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Ilie, L., Smyth, W.F.: A Simple Algorithm for Computing the Lempel Ziv Factorization. In: Proc. Data Compression Conference DCC 2008, Snowbird, Utah, pp. 482\u2013488 (2008)","DOI":"10.1109\/DCC.2008.36"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01185434","volume":"12","author":"A.S. Fraenkel","year":"1994","unstructured":"Fraenkel, A.S., Klein, S.T.: Complexity Aspects of Guessing Prefix Codes. Algorithmica\u00a012, 409\u2013419 (1994)","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/1103963.1103971","volume":"1","author":"M. Chrobak","year":"2005","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms\u00a01(2), 350\u2013366 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"6_CR7","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":"6_CR8","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"Huffman, D.: A method for the construction of minimum redundancy codes. Proc. of the IRE\u00a040, 1098\u20131101 (1952)","journal-title":"Proc. of the IRE"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-45123-4_19","volume-title":"Proc. 11th Symp. on Combinatorial Pattern Matching","author":"S.T. Klein","year":"2000","unstructured":"Klein, S.T.: Improving static compression schemes by alphabet extension. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 210\u2013221. Springer, Heidelberg (2000)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Klein, S.T., Kopel Ben-Nissan, M.: Using Fibonacci compression codes as alternatives to dense codes. In: Proc. Data Compression Conference DCC 2008, Snowbird, Utah, pp. 472\u2013481 (2008)","DOI":"10.1109\/DCC.2008.54"},{"key":"6_CR11","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":"6_CR12","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":"6_CR13","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/18.556121","volume":"43","author":"S.A. Savari","year":"1997","unstructured":"Savari, S.A., Gallager, R.G.: Generalized Tunstall codes for sources with memory. IEEE Trans. Info. Theory\u00a0 IT\u201343, 658\u2013668 (1997)","journal-title":"IEEE Trans. Info. Theory"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TIT.1987.1057285","volume":"33","author":"T.J. Tjalkens","year":"1987","unstructured":"Tjalkens, T.J., Willems, F.M.J.: Variable to fixed length codes for Markov sources. IEEE Trans. Info. Theory\u00a0IT\u201333, 246\u2013257 (1987)","journal-title":"IEEE Trans. Info. Theory"},{"key":"6_CR15","unstructured":"Tunstall, B.P.: Synthesis of noiseless compression codes, Ph.D dissertation, Georgia Institute of Technology, Atlanta, GA (1967)"},{"issue":"3","key":"6_CR16","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":"6_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-94-017-2535-4_19","volume-title":"Parallel Text Processing","author":"J. V\u00e9ronis","year":"2000","unstructured":"V\u00e9ronis, J., Langlais, P.: Evaluation of parallel text alignment systems: The arcade project. In: V\u00e9ronis, J. (ed.) Parallel Text Processing, pp. 369\u2013388. Kluwer Academic Publishers, Dordrecht (2000)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89097-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T06:33:21Z","timestamp":1557902001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89097-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540890966","9783540890973"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89097-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}