{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:43Z","timestamp":1725544063718},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_26","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"282-293","source":"Crossref","is-referenced-by-count":6,"title":["A Simpler Analysis of Burrows-Wheeler Based Compression"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shir","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Verbin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"The canterbury corpus, \n                    \n                      http:\/\/corpus.canterbury.ac.nz","key":"26_CR1"},{"unstructured":"Abel, J.: Web page about Distance Coding, \n                    \n                      http:\/\/www.data-compression.info\/Algorithms\/DC\/","key":"26_CR2"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TIT.1987.1057284","volume":"33","author":"A. Apostolico","year":"1987","unstructured":"Apostolico, A., Fraenkel, A.S.: Robust transmission of unbounded strings using fibonacci representations. IEEE Transactions on Information Theory\u00a033(2), 238\u2013245 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"J.L. Bentley","year":"1986","unstructured":"Bentley, J.L., Sleator, D.D., Tarjan, R.E., Wei, V.K.: A locally adaptive data compression scheme. Communications of the ACM\u00a029(4), 320\u2013330 (1986)","journal-title":"Communications of the ACM"},{"unstructured":"Binder, E.: Distance coder. Usenet group comp.compression (2000)","key":"26_CR5"},{"unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California (1994)","key":"26_CR6"},{"unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, ch. 16.3, 2nd edn., pp. 385\u2013392. MIT Press and McGraw-Hill (2001)","key":"26_CR7"},{"issue":"2","key":"26_CR8","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\u2013Wheeler compression algorithm. Software \u2013 Practice and Experience\u00a032(2), 99\u2013111 (2002)","journal-title":"Software \u2013 Practice and Experience"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representation of the integers. IEEE Trans. on Information Theory\u00a021(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. on Information Theory"},{"key":"26_CR10","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"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","volume":"64","author":"A.S. Fraenkel","year":"1996","unstructured":"Fraenkel, A.S., Klein, S.T.: Robust universal complete codes for transmission and compression. Discrete Applied Mathematics\u00a064(1), 31\u201355 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proceedings of the IRE\u00a040(9), 1098\u20131101 (1952)","journal-title":"Proceedings of the IRE"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/45072.45074","volume":"19","author":"D.A. Lelewer","year":"1987","unstructured":"Lelewer, D.A., Hirschberg, D.S.: Data compression. ACM Computing Surveys\u00a019(3), 261\u2013296 (1987)","journal-title":"ACM Computing Surveys"},{"unstructured":"Manzini, G.: Personal communication","key":"26_CR14"},{"issue":"3","key":"26_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":"26_CR16","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"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/290159.290162","volume":"16","author":"A. Moffat","year":"1998","unstructured":"Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Trans. Inf. Syst.\u00a016(3), 256\u2013294 (1998)","journal-title":"ACM Trans. Inf. Syst."},{"unstructured":"Seward, J.: bzip2, a program and library for data compression, \n                    \n                      http:\/\/www.bzip.org\/","key":"26_CR18"},{"issue":"6","key":"26_CR19","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:16Z","timestamp":1619493376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11780441_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}