Comparison of LZ77/78 decomposition and compression algorithms

[krzysztof-turowski]

Overall, the aim is to implement several LZ77/78 decomposition algorithms and their reverse methods, and to compare them in terms of efficiency (number of accesses of characters) and running time.

Selected relevant literature: [1] Ziv, Lempel - A universal algorithm for sequential data compression [2] Ziv, Lempel - Compression of individual sequences via variable-rate coding [3] Na, Apostolico, Iliopoulos, Park - Truncated suffix trees and their application to data compression (truncated suffix tree structure and its usage in LZ77) [4] Chen, Puglisi, Smyth - Lempel–Ziv Factorization Using Less Time & Space [5] Ohno et al. - A faster implementation of online RLBWT and its application to LZ77 parsing [6] Rodeh, Pratt, Even - Linear Algorithm for Data Compression via String Matching [7] Kärkkäinen, Kempa, Puglisi - Lazy Lempel-Ziv Factorization Algorithms