{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:12Z","timestamp":1740181572696,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:00:00Z","timestamp":1679011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:00:00Z","timestamp":1679011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01629-5","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:50:23Z","timestamp":1679878223000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Burrows\u2013Wheeler Compression"],"prefix":"10.1007","volume":"4","author":[{"given":"Aharon","family":"Fruchtman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Gross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel T.","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"1629_CR1","unstructured":"Burrows M, Wheeler D.J. A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"issue":"3","key":"1629_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE Trans Inf Theory. 1977;23(3):337\u201343.","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"1629_CR3","first-page":"85","volume":"52","author":"A Moffat","year":"2019","unstructured":"Moffat A. Huffman coding. ACM Comput Surv. 2019;52(4):85\u201318535.","journal-title":"ACM Comput Surv"},{"key":"1629_CR4","unstructured":"Fruchtman A, Gross Y, Klein ST, Shapira D. Weighted Burrows-Wheeler compression. CoRR abs\/2105.10327 (2021)"},{"issue":"6","key":"1629_CR5","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1137\/070685373","volume":"38","author":"W Hon","year":"2009","unstructured":"Hon W, Sadakane K, Sung W. Breaking a time-and-space barrier in constructing full-text indices. SIAM J Comput. 2009;38(6):2162\u201378.","journal-title":"SIAM J Comput"},{"key":"1629_CR6","doi-asserted-by":"crossref","unstructured":"Kempa D, Kociumaka T. String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. In: Charikar M, Cohen E, editors. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23\u201326; 2019. p. 756\u2013767.","DOI":"10.1145\/3313276.3316368"},{"issue":"4","key":"1629_CR7","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"JL Bentley","year":"1986","unstructured":"Bentley JL, Sleator DD, Tarjan RE, Wei VK. A locally adaptive data compression scheme. Commun ACM. 1986;29(4):320\u201330.","journal-title":"Commun ACM"},{"issue":"9","key":"1629_CR8","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/30401.315747","volume":"30","author":"BY Ryabko","year":"1987","unstructured":"Ryabko BY, Horspool RN, Cormack GV. Comments to: a locally adaptive data compression scheme. Commun ACM. 1987;30(9):792\u20134.","journal-title":"Commun ACM"},{"key":"1629_CR9","doi-asserted-by":"crossref","unstructured":"Arnavut Z, Magliveras SS. Block sorting and compression. In: Storer JA, Cohn M, editors. Proceedings of the 7th Data Compression Conference (DCC \u201997), Snowbird, Utah, USA, March 25\u201327; 1997. p. 181\u2013190.","DOI":"10.1109\/DCC.1997.582009"},{"key":"1629_CR10","unstructured":"Binder E. Distance coder. Usenet group: comp.compression. 2000. http:\/\/groups.google.com\/group\/comp.compression\/msg\/27d46abca0799d12."},{"issue":"31\u201333","key":"1629_CR11","doi-asserted-by":"publisher","first-page":"2925","DOI":"10.1016\/j.tcs.2010.04.024","volume":"411","author":"T Gagie","year":"2010","unstructured":"Gagie T, Manzini G. Move-to-front, distance coding, and inversion frequencies revisited. Theor Comput Sci. 2010;411(31\u201333):2925\u201344.","journal-title":"Theor Comput Sci"},{"key":"1629_CR12","doi-asserted-by":"crossref","unstructured":"Fruchtman A, Gross Y, Klein S.T, Shapira D. Backward weighted coding. In: 31st Data Compression Conference, DCC 2021, Snowbird, UT, USA, March 23\u201326; 2021. p. 93\u2013102.","DOI":"10.1109\/DCC50243.2021.00017"},{"issue":"9","key":"1629_CR13","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1093\/comjnl\/39.9.731","volume":"39","author":"PM Fenwick","year":"1996","unstructured":"Fenwick PM. The Burrows-Wheeler transform for block sorting text compression: principles and improvements. Comput J. 1996;39(9):731\u201340.","journal-title":"Comput J"},{"issue":"3","key":"1629_CR14","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00224-020-09992-7","volume":"65","author":"ST Klein","year":"2020","unstructured":"Klein ST, Saadia S, Shapira D. Forward looking Huffman coding. Theory Comput Syst. 2020;65(3):593\u2013612.","journal-title":"Theory Comput Syst"},{"key":"1629_CR15","unstructured":"Fruchtman A, Klein S.T, Shapira D. Bidirectional adaptive compression. In: Proceedings of the Prague Stringology Conference; 2019. pp. 92\u2013101."},{"key":"1629_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2022.07.013","volume":"930","author":"A Fruchtman","year":"2022","unstructured":"Fruchtman A, Gross Y, Klein ST, Shapira D. Weighted forward looking adaptive coding. Theor Comput Sci. 2022;930:86\u201399.","journal-title":"Theor Comput Sci"},{"issue":"3","key":"1629_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s42979-022-01121-0","volume":"3","author":"RM Avrunin","year":"2022","unstructured":"Avrunin RM, Klein ST, Shapira D. Combining forward compression with PPM. SN Comput Sci. 2022;3(3):239.","journal-title":"SN Comput Sci"},{"issue":"4","key":"1629_CR18","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J Cleary","year":"1984","unstructured":"Cleary J, Witten I. Data compression using adaptive coding and partial string matching. IEEE Trans Commun. 1984;32(4):396\u2013402.","journal-title":"IEEE Trans Commun"},{"issue":"6","key":"1629_CR19","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten IH, Neal RM, Cleary JG. Arithmetic coding for data compression. Commun ACM. 1987;30(6):520\u201340.","journal-title":"Commun ACM"},{"issue":"4","key":"1629_CR20","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"JS Vitter","year":"1987","unstructured":"Vitter JS. Design and analysis of dynamic Huffman codes. JACM. 1987;34(4):825\u201345.","journal-title":"JACM"},{"key":"1629_CR21","first-page":"550","volume-title":"The data compression book","author":"M Nelson","year":"1996","unstructured":"Nelson M, Gailly J-L. The data compression book. New York: M & T Books; 1996. p. 550\u20131."},{"issue":"2","key":"1629_CR22","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 Trans Inf Theory. 1975;21(2):194\u2013203.","journal-title":"IEEE Trans Inf Theory"},{"key":"1629_CR23","doi-asserted-by":"crossref","unstructured":"Moffat A, Turpin A. Compression and Coding Algorithms. The international series in engineering and computer science, vol. 669, Kluwer (2002)","DOI":"10.1007\/978-1-4615-0935-6"},{"key":"1629_CR24","unstructured":"Gray F. Pulse code communication. U.S. Patent 2,632,058A, Serial No. 785697 (1953)"},{"key":"1629_CR25","volume-title":"Introduction to information theory and data compression","author":"DC Hankerson","year":"1998","unstructured":"Hankerson DC, Harris GA, Johnson J. Introduction to information theory and data compression. Boca Raton, Florida: CRC; 1998."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01629-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01629-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01629-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T01:54:47Z","timestamp":1729130087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01629-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,17]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["1629"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01629-5","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2023,3,17]]},"assertion":[{"value":"12 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"265"}}