{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:01:07Z","timestamp":1761843667332},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_10","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"71-82","source":"Crossref","is-referenced-by-count":6,"title":["Move-to-Front, Distance Coding, and Inversion Frequencies Revisited"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Arnavut, Z., Magliveras, S.: Block sorting and compression. In: Procs of IEEE Data Compression Conference (DCC), pp. 181\u2013190 (1997)","DOI":"10.1109\/DCC.1997.582009"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"J. Bentley","year":"1986","unstructured":"Bentley, J., Sleator, D., Tarjan, R., Wei, V.: A locally adaptive data compression scheme. Communications of the ACM\u00a029(4), 320\u2013330 (1986)","journal-title":"Communications of the ACM"},{"key":"10_CR3","unstructured":"Binder, E.: Distance coder, Usenet group (2000) comp.compression"},{"key":"10_CR4","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/spe.426","volume":"32","author":"S. Deorowicz","year":"2002","unstructured":"Deorowicz, S.: Second step algorithms in the Burrows-Wheeler compression algorithm. Software: Practice and Experience\u00a032(2), 99\u2013111 (2002)","journal-title":"Software: Practice and Experience"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1002\/spe.484","volume":"32","author":"P. Fenwick","year":"2002","unstructured":"Fenwick, P.: Burrows-Wheeler compression with variable length integer codes. Software: Practice and Experience\u00a032, 1307\u20131316 (2002)","journal-title":"Software: Practice and Experience"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/11841036_67","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Ferragina","year":"2006","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G.: The engineering of a compression boosting library: Theory vs practice in bwt compression. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 756\u2013767. Springer, Heidelberg (2006)"},{"key":"10_CR8","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":"10_CR9","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":"10_CR10","doi-asserted-by":"crossref","unstructured":"Foschini, L., Grossi, R., Gupta, A., Vitter, J.: Fast compression with a static model in high-order entropy. In: Procs of IEEE Data Compression Conference (DCC), pp. 62\u201371 (2004)","DOI":"10.1109\/DCC.2004.1281451"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44888-8_10","volume-title":"Combinatorial Pattern Matching","author":"R. Giancarlo","year":"2003","unstructured":"Giancarlo, R., Sciortino, M.: Optimal partitions of strings: A new class of Burrows-Wheeler compression algorithms. In: Baeza-Yates, R.A., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 129\u2013143. Springer, Heidelberg (2003)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"issue":"1","key":"10_CR13","first-page":"40","volume":"12","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing\u00a012(1), 40\u201366 (2005)","journal-title":"Nordic Journal of Computing"},{"issue":"3","key":"10_CR14","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":"10_CR15","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys (to Appear)","DOI":"10.1145\/1216370.1216372"},{"key":"10_CR16","unstructured":"Ryabko, B.Y.: Data compression by means of a \u2019book stack\u2019. Prob.Inf.Transm, 16(4) (1980)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:02Z","timestamp":1619518322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}