{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:57:00Z","timestamp":1725512220092},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708803"},{"type":"electronic","value":"9783540708810"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70881-0_13","type":"book-chapter","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T20:07:32Z","timestamp":1186171652000},"page":"124-134","source":"Crossref","is-referenced-by-count":2,"title":["Improving Semistatic Compression Via Pair-Based Coding"],"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":"13_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":"13_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":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/978-3-540-30213-1_34","volume-title":"String Processing and Information Retrieval","author":"N. Brisaboa","year":"2004","unstructured":"Brisaboa, N.: Simple, fast, and efficient natural language adaptive compression. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 230\u2013241. Springer, Heidelberg (2004)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Brisaboa, N., et al.: Lightweight natural language text compression. Information Retrieval, To appear (2006)","DOI":"10.1007\/s10791-006-9001-9"},{"key":"13_CR5","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., et al.: An efficient compression code for text databases. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol.\u00a02633, pp. 468\u2013481. Springer, Heidelberg (2003)"},{"key":"13_CR6","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124 (1994)"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Silva de Moura","year":"2000","unstructured":"Silva de Moura, E., et al.: Fast and flexible word searching on compressed text. ACM TOIS\u00a018(2), 113\u2013139 (2000)","journal-title":"ACM TOIS"},{"key":"13_CR8","first-page":"703","volume-title":"Proceedings of the 27th ACM-STOC","author":"M. Farach","year":"1995","unstructured":"Farach, M., Thorup, M.: String matching in lempel-ziv compressed strings. In: Proceedings of the 27th ACM-STOC, pp. 703\u2013712. ACM Press, New York (1995), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/225058.225288"},{"issue":"6","key":"13_CR9","first-page":"501","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. SPE\u00a010(6), 501\u2013506 (1980)","journal-title":"SPE"},{"issue":"9","key":"13_CR10","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":"2","key":"13_CR11","first-page":"185","volume":"19","author":"A. Moffat","year":"1989","unstructured":"Moffat, A.: Word-based text compression. SPE\u00a019(2), 185\u2013198 (1989)","journal-title":"SPE"},{"issue":"1","key":"13_CR12","first-page":"49","volume":"3","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., et al.: Adding compression to block addressing inverted indexes. IR\u00a03(1), 49\u201377 (2000)","journal-title":"IR"},{"key":"13_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45123-4_16","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Tarhio, J.: Boyer-Moore string matching over Ziv-Lempel compressed text. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 166\u2013180. Springer, Heidelberg (2000)"},{"issue":"3","key":"13_CR15","first-page":"337","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE TIT\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE TIT"},{"issue":"5","key":"13_CR16","first-page":"530","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE TIT\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE TIT"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70881-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:10:59Z","timestamp":1605762659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70881-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708803","9783540708810"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70881-0_13","relation":{},"subject":[]}}