{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T08:25:04Z","timestamp":1777710304063,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_67","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"756-767","source":"Crossref","is-referenced-by-count":19,"title":["The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Giancarlo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"67_CR1","doi-asserted-by":"crossref","unstructured":"Abel, J.: Post BWT stages of the Burrows-Wheeler compression algorithm. A fast and efficient post BWT-stage for the Burrows-Wheeler compression algorithm. In: Proc. IEEE DCC, p. 449 (submitted, 2005)","DOI":"10.1002\/spe.763"},{"key":"67_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44888-8_5","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 55\u201369. Springer, Heidelberg (2003)"},{"key":"67_CR3","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"67_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ipl.2005.03.008","volume":"95","author":"S. Deorowicz","year":"2005","unstructured":"Deorowicz, S.: Context exhumation after the BurrowsWheeler transform. Information Processing Letters\u00a095, 313\u2013320 (2005)","journal-title":"Information Processing Letters"},{"key":"67_CR5","unstructured":"Fenwick, P.: Block sorting text compression \u2014 final report. Technical Report 130, Dept. of Computer Science, The University of Auckland New Zeland (1996)"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G.: The engineering of a compression boosting library: Theory vs practice in BWT compression. Technical Report TR-INF-2006-06-03-UNIPMN (2006), http:\/\/www.di.unipmn.it","DOI":"10.1007\/11841036_67"},{"key":"67_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/11786986_49","volume-title":"Automata, Languages and Programming","author":"P. Ferragina","year":"2006","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G.: The myriad virtues of wavelet trees. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 561\u2013572. Springer, Heidelberg (2006)"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/1082036.1082043","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. Journal of the ACM\u00a052, 688\u2013713 (2005)","journal-title":"Journal of the ACM"},{"key":"67_CR9","first-page":"62","volume-title":"IEEE DCC","author":"L. Foschini","year":"2004","unstructured":"Foschini, L., Grossi, R., Gupta, A., Vitter, J.: Fast compression with a static model in high order entropy. In: IEEE DCC, pp. 62\u201371. IEEE Computer Society TCC, Los Alamitos (2004)"},{"key":"67_CR10","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2003), pp. 841\u2013850 (2003)"},{"key":"67_CR11","unstructured":"Grossi, R., Gupta, A., Vitter, J.: When indexing equals compression: Experiments on compressing suffix arrays and applications. In: Proc. 15th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2004), pp. 636\u2013645 (2004)"},{"key":"67_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11780441_26","volume-title":"Combinatorial Pattern Matching","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Landau, S., Verbin, E.: A simpler analysis of Burrows-Wheeler based compression. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"67_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"67_CR14","unstructured":"Lundqvist, M.: Carryless range coding, http:\/\/hem.spray.se\/mikael.lundqvist\/"},{"issue":"3","key":"67_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"Journal of the ACM"},{"key":"67_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27810-8_32","volume-title":"Algorithm Theory - SWAT 2004","author":"G. Manzini","year":"2004","unstructured":"Manzini, G.: Two space saving tricks for linear time LCP computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 372\u2013383. Springer, Heidelberg (2004)"},{"key":"67_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica\u00a040, 33\u201350 (2004)","journal-title":"Algorithmica"},{"key":"67_CR18","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full text indexes. Technical Report TR\/DCC-2006-6, Dept. of Computer Science, University of Chile (2006)"},{"key":"67_CR19","unstructured":"Seward, J.: The bzip2 home page (2006), http:\/\/www.bzip.org"},{"key":"67_CR20","unstructured":"Shkarin, D.: PPMd compressor Ver. J., http:\/\/www.compression.ru\/ds\/"},{"key":"67_CR21","doi-asserted-by":"crossref","unstructured":"Shkarin, D.: PPM: One step to practicality. In: IEEE Data Compression Conference, pp. 202\u2013211 (2002)","DOI":"10.1109\/DCC.2002.999958"},{"key":"67_CR22","unstructured":"Wheeler, D.: Improving Huffman coding (1997), ftp:\/\/ftp.cl.cam.ac.uk\/users\/djw3\/huff.ps"},{"issue":"6","key":"67_CR23","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Communications of the ACM\u00a030(6), 520\u2013540 (1987)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:33:29Z","timestamp":1736541209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11841036_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}