{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:43Z","timestamp":1725484303338},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_4","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:55:29Z","timestamp":1179280529000},"page":"32-41","source":"Crossref","is-referenced-by-count":0,"title":["Block Merging for Off-Line Compression"],"prefix":"10.1007","author":[{"given":"Raymond","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"issue":"11","key":"4_CR1","doi-asserted-by":"crossref","first-page":"1733","DOI":"10.1109\/5.892709","volume":"88","author":"A. Apostolico","year":"2000","unstructured":"A. Apostolico and S. Lonardi. Off-line compression by greedy textual substitution. Proc. IEEE, 88(11):1733\u20131744, Nov. 2000.","journal-title":"Proc. IEEE"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/SPIRE.2001.989735","volume-title":"Proc. 8th International Symposium on String Processing and Information Retrieval","author":"D. Bahle","year":"2001","unstructured":"D. Bahle, H. E. Williams, and J. Zobel. Compaction techniques for nextword indexes. In G. Navarro, editor, Proc. 8th International Symposium on String Processing and Information Retrieval, pages 33\u201345. IEEE Computer Society Press, Los Alamitos, CA, Nov. 2001."},{"key":"4_CR3","first-page":"287","volume-title":"Proc. 1999 IEEE Data Compression Conference","author":"J. Bentley","year":"1999","unstructured":"J. Bentley and D. McIlroy. Data compression using long common strings. In J. A. Storer and M. Cohn, editors, Proc. 1999 IEEE Data Compression Conference, pages 287\u2013295. IEEE Computer Society Press, Los Alamitos, California, Mar. 1999."},{"key":"4_CR4","first-page":"6","volume-title":"Proc. 11th Australasian Database Conference","author":"A. Cannane","year":"2000","unstructured":"A. Cannane and H. E. Williams. A compression scheme for large databases. In M. E. Orlowska, editor, Proc. 11th Australasian Database Conference, pages 6\u201311, Canberra, Australia, 2000. IEEE Computer Society Press, Los Alamitos, CA."},{"issue":"5","key":"4_CR5","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1002\/1532-2890(2001)9999:9999<::AID-ASI1084>3.0.CO;2-Z","volume":"52","author":"A. Cannane","year":"2001","unstructured":"A. Cannane and H. E. Williams. General-purpose compression for efficient retrieval. Journal of the American Society for Information Science and Technology, 52(5):430\u2013437, Mar. 2001.","journal-title":"Journal of the American Society for Information Science and Technology"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. S. Moura de","year":"2000","unstructured":"E. S. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems, 18(2): 113\u2013139, 2000.","journal-title":"ACM Transactions on Information Systems"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1093\/comjnl\/32.3.228","volume":"32","author":"J. Katajainen","year":"1989","unstructured":"J. Katajainen and T. Raita. An approximation algorithm for space-optimal encoding of a text. The Computer Journal, 32(3):228\u2013237, 1989.","journal-title":"The Computer Journal"},{"issue":"2\/3","key":"4_CR8","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":"S. T. Klein. Efficient optimal recompression. The Computer Journal, 40(2\/3): 117\u2013126, 1997.","journal-title":"The Computer Journal"},{"issue":"11","key":"4_CR9","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"N. J. Larsson","year":"2000","unstructured":"N. J. Larsson and A. Moffat. Offline dictionary-based compression. Proc. IEEE, 88(11):1722\u20131732, Nov. 2000.","journal-title":"Proc. IEEE"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"U. Manber. A text compression scheme that allows fast searching directly in the compressed file. ACM Transactions on Information Systems, 15(2): 124\u2013136, Apr. 1997.","DOI":"10.1145\/248625.248639"},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0935-6","volume-title":"Compression and Coding Algorithms","author":"A. Moffat","year":"2002","unstructured":"A. Moffat and A. Turpin. Compression and Coding Algorithms. Kluwer Academic Publishers, Boston, MA, 2002."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:52:45Z","timestamp":1556412765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}