{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:41Z","timestamp":1740181541314,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T00:00:00Z","timestamp":1650672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T00:00:00Z","timestamp":1650672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s42979-022-01121-0","type":"journal-article","created":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T14:03:52Z","timestamp":1650722632000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Combining Forward Compression with PPM"],"prefix":"10.1007","volume":"3","author":[{"given":"Rachel Mustakis","family":"Avrunin","sequence":"first","affiliation":[]},{"given":"Shmuel T.","family":"Klein","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,23]]},"reference":[{"issue":"4","key":"1121_CR1","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"JG Cleary","year":"1984","unstructured":"Cleary JG, Witten IH. Data compression using adaptive coding and partial string matching. IEEE Trans Commun. 1984;32(4):396\u2013402.","journal-title":"IEEE Trans Commun"},{"issue":"9","key":"1121_CR2","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman DA. A method for the construction of minimum-redundancy codes. Proc IRE. 1952;40(9):1098\u2013101.","journal-title":"Proc IRE"},{"issue":"6","key":"1121_CR3","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":"2","key":"1121_CR4","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":"1121_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.dam.2015.11.003","volume":"212","author":"ST Klein","year":"2016","unstructured":"Klein ST, Shapira D. Random access to Fibonacci encoded files. Discrete Appl Math. 2016;212:115\u201328.","journal-title":"Discrete Appl Math"},{"key":"1121_CR6","unstructured":"Tunstall BP. Synthesis of noiseless compression codes. PhD thesis, Georgia Institute of Technology. 1967."},{"issue":"5","key":"1121_CR7","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.ipm.2011.01.005","volume":"47","author":"ST Klein","year":"2011","unstructured":"Klein ST, Shapira D. On improving Tunstall codes. Inf Process Manage. 2011;47(5):777\u201385.","journal-title":"Inf Process Manage"},{"issue":"3","key":"1121_CR8","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":"5","key":"1121_CR9","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv J, Lempel A. Compression of individual sequences via variable-rate coding. IEEE Trans Inf Theory. 1978;24(5):530\u20136.","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"1121_CR10","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer JA, Szymanski TG. Data compression via textual substitution. J ACM. 1982;29(4):928\u201351.","journal-title":"J ACM"},{"issue":"6","key":"1121_CR11","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"TA Welch","year":"1984","unstructured":"Welch TA. A technique for high-performance data compression. IEEE Comput. 1984;17(6):8\u201319.","journal-title":"IEEE Comput"},{"key":"1121_CR12","doi-asserted-by":"crossref","unstructured":"Moffat A, Turpin A. Compression and Coding Algorithms. In: The international series in engineering and computer science, 1st ed., vol. 669. Kluwer, Springer, English; 2002","DOI":"10.1007\/978-1-4615-0935-6"},{"issue":"3","key":"1121_CR13","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00224-020-09992-7","volume":"65","author":"ST Klein","year":"2021","unstructured":"Klein ST, Saadia S, Shapira D. Forward looking Huffman coding. Theory Comput Syst. 2021;65(3):593\u2013612.","journal-title":"Theory Comput Syst"},{"key":"1121_CR14","unstructured":"Fruchtman A, Klein ST, Shapira D. Bidirectional adaptive compression. In: Proceedings of the Prague Stringology Conference 2019; 2019. pp. 92\u2013101."},{"key":"1121_CR15","doi-asserted-by":"crossref","unstructured":"Klein ST, Shapira D. A new compression method for compressed matching. In: Data compression conference, DCC 2000, Snowbird; 2000. pp. 400\u2013409.","DOI":"10.1109\/DCC.2000.838180"},{"issue":"2","key":"1121_CR16","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/63522.214390","volume":"15","author":"JS Vitter","year":"1989","unstructured":"Vitter JS. Algorithm 673: Dynamic Huffman coding. ACM Trans Math Softw. 1989;15(2):158\u201367.","journal-title":"ACM Trans Math Softw"},{"key":"1121_CR17","doi-asserted-by":"crossref","unstructured":"Fruchtman A, Gross Y, Klein ST, Shapira D. Weighted adaptive coding. CoRR abs\/2005.08232; 2020.","DOI":"10.1109\/DCC47342.2020.00059"},{"key":"1121_CR18","doi-asserted-by":"crossref","unstructured":"Fruchtman A, Gross Y, Klein ST, Shapira D. Backward weighted coding. In: Data compression conference, DCC 2000, Snowbird; 2021. pp. 93\u2013102","DOI":"10.1109\/DCC50243.2021.00017"},{"key":"1121_CR19","unstructured":"Fruchtman A, Gross Y, Klein ST, Shapira D. Weighted Burrows-Wheeler compression. CoRR abs\/2105.10327; 2021."},{"key":"1121_CR20","doi-asserted-by":"crossref","unstructured":"V\u00e9ronis J, Langlais P. Evaluation of parallel text alignment systems: the arcade project. In: V\u00e9ronis J, editor. Parallel text processing, Chapter 19. Dordrecht: Kluwer Academic Publishers; 2000. pp. 369\u2013388.","DOI":"10.1007\/978-94-017-2535-4_19"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01121-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01121-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01121-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T20:52:15Z","timestamp":1727038335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01121-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,23]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1121"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01121-0","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,4,23]]},"assertion":[{"value":"10 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"239"}}