{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:26:41Z","timestamp":1725481601470},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403111"},{"type":"electronic","value":"9783540448884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44888-8_10","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T11:34:12Z","timestamp":1173094452000},"page":"129-143","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms"],"prefix":"10.1007","author":[{"given":"Raffaele","family":"Giancarlo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"10_CR1","unstructured":"Burrows, M., Wheeler, D.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1093\/comjnl\/39.9.731","volume":"39","author":"P. Fenwick","year":"1996","unstructured":"Fenwick, P.: The Burrows-Wheeler transform for block sorting text compression. The Computer Journal 39 (1996) 731\u2013740","journal-title":"The Computer Journal"},{"key":"10_CR3","unstructured":"Buchsbaum, A.L., Caldwell, D.F., Church, K.W., Fowler, G.S., Muthukrishnan, S.: Engineering the compression of massive tables: An experimental approach. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms. (2000) 175\u2013184"},{"key":"10_CR4","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 48 (2001) 407\u2013430","journal-title":"Journal of the ACM"},{"key":"10_CR5","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. Comm. of ACM 29 (1986) 320\u2013330","journal-title":"Comm. of ACM"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Interscience (1990)","DOI":"10.1002\/0471200611"},{"key":"10_CR7","unstructured":"Effros, M.: Universal lossless source coding with the Burrows-Wheeler transform. In: Proc. IEEE Data Compression Conference, IEEE Computer Society (1999) 178\u2013187"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Sadakane, K.: On optimality of variants of the block sorting compression. In: Proc. IEEE Data Compression Conference, IEEE Computer Society (1998) 570","DOI":"10.1109\/DCC.1998.672312"},{"key":"10_CR9","unstructured":"Arnavut, Z., Magliveras, S.S.: Block sorting and compression. In: Proc. IEEE Data Compression Conference, IEEE Computer Society (1997) 181\u2013190"},{"key":"10_CR10","unstructured":"Balkenhol, B., Kurtz, S.: Universal data compression based on the Burrows and Wheeler-transformation: Theory and practice. Technical Report 98-069, Sonderforshunngsbereich: Diskrete Strukturen in der Mathematik, Universit\u00e4t Bielefeld, Germany (1998) Available from http:\/\/www.mathematik.uni-bielefeld.de\/sfb343\/preprints ."},{"key":"10_CR11","unstructured":"Wirth, A.I., Moffat, A.: Can we do without ranks in Burrows Wheeler transform compression? In: Proc. IEEE Data Compression Conference, IEEE Computer Society (2001) 419\u2013428"},{"key":"10_CR12","unstructured":"Buchsbaum, A.L., Giancarlo, R., Fowler, G.S.: Improving table compression with combinatorial optimization. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms. (2002) 213\u2013222"},{"key":"10_CR13","first-page":"337","volume":"IT-23","author":"A. Lempel","year":"1977","unstructured":"Lempel, A., Ziv, J.: A universal algorithm for sequential data compression. IEEE Trans. on Information Theory IT-23 (1977) 337\u2013343","journal-title":"IEEE Trans. on Information Theory"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. on Information Theory IT-24 (1978) 530\u2013578","journal-title":"IEEE Trans. on Information Theory"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"COM-38","author":"A. Moffat","year":"1990","unstructured":"Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. on Communication COM-38 (1990) 1917\u20131921","journal-title":"IEEE Trans. on Communication"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1093\/comjnl\/30.6.541","volume":"30","author":"G. Cormak","year":"1987","unstructured":"Cormak, G., Horspool, R.: Data compression using dynamic markov modelling. Computer J. 30 (1987) 541\u2013550","journal-title":"Computer J"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1093\/comjnl\/40.2_and_3.67","volume":"40","author":"J. Cleary","year":"1997","unstructured":"Cleary, J., Teahan, W.: Unbounded length contexts for PPM. Computer J. 40 (1997) 67\u201375","journal-title":"Computer J"},{"key":"10_CR18","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 representations of the integers. IEEE Transactions on Information Theory 21 (1975) 194\u2013203","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR19","first-page":"173","volume-title":"(Translation from) Problems in Cybernetics","author":"V. Levenshtein","year":"1968","unstructured":"Levenshtein, V.: On the redundancy and delay of decodable coding of natural numbers. (Translation from) Problems in Cybernetics, Nauka, Mscow 20 (1968) 173\u2013179"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1109\/TIT.1986.1057239","volume":"32","author":"R.M. Capocelli","year":"1986","unstructured":"Capocelli, R.M., Giancarlo, R., Taneja, I.: Bounds on the redundancy of Huffman codes. IEEE Transactions on Information Theory 32 (1986) 854\u2013857","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44888-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T01:41:04Z","timestamp":1556156464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44888-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403111","9783540448884"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44888-8_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}