{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:39Z","timestamp":1725566379011},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232100"},{"type":"electronic","value":"9783540302131"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30213-1_34","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:26:07Z","timestamp":1285097167000},"page":"230-241","source":"Crossref","is-referenced-by-count":5,"title":["Simple, Fast, and Efficient Natural Language Adaptive Compression"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Fari\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Param\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Text Compression","author":"T.C. Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.H.: Text Compression. Prentice-Hall, Englewood Cliffs (1990)"},{"issue":"10","key":"34_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"34_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. Brisaboa","year":"2003","unstructured":"Brisaboa, N., Iglesias, E., Navarro, G., Param\u00e1, J.: An efficient compression code for text databases. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol.\u00a02633, pp. 468\u2013481. Springer, Heidelberg (2003)"},{"key":"34_CR4","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":"34_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124 (1994)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"de Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast searching on compressed text allowing errors. In: Proc. 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 1998), pp. 298\u2013306 (1998)","DOI":"10.1145\/290941.291013"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Moura de","year":"2000","unstructured":"de Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Transactions on Information Systems (TOIS)\u00a018(2), 113\u2013139 (2000)","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"34_CR8","unstructured":"Faller, N.: An adaptive system for data compression. In: Record of the 7th Asilomar Conference on Circuits, Systems, and Computers, pp. 593\u2013597 (1973)"},{"issue":"6","key":"34_CR9","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"24","author":"R.G. Gallager","year":"1978","unstructured":"Gallager, R.G.: Variations on a theme by Huffman. IEEE Trans. on Inf. Theory\u00a024(6), 668\u2013674 (1978)","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"34_CR10","volume-title":"Information Retrieval: Computational and Theoretical Aspects","author":"H.S. Heaps","year":"1978","unstructured":"Heaps, H.S.: Information Retrieval: Computational and Theoretical Aspects. Academic Press, New York (1978)"},{"issue":"9","key":"34_CR11","first-page":"1098","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng.\u00a040(9), 1098\u20131101 (1952)","journal-title":"Proc. Inst. Radio Eng."},{"issue":"6","key":"34_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"2","author":"D.E. Knuth","year":"1985","unstructured":"Knuth, D.E.: Dynamic Huffman coding. Journal of Algorithms\u00a02(6), 163\u2013180 (1985)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"34_CR13","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 - Practice and Experience\u00a019(2), 185\u2013198 (1989)","journal-title":"Software - Practice and Experience"},{"issue":"4","key":"34_CR14","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"J.S. Vitter","year":"1987","unstructured":"Vitter, J.S.: Design and analysis of dynamic Huffman codes. Journal of the ACM (JACM)\u00a034(4), 825\u2013845 (1987)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"34_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/63522.214390","volume":"15","author":"J.S. Vitter","year":"1989","unstructured":"Vitter, J.S.: Algorithm 673: dynamic Huffman coding. ACM Transactions on Mathematical Software (TOMS)\u00a015(2), 158\u2013167 (1989)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"}],"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-30213-1_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:56:20Z","timestamp":1620014180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30213-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232100","9783540302131"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30213-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}