A comparison of index-based lempel-Ziv LZ77 factorization algorithms

@article{AlHafeedh2012ACO,
  title={A comparison of index-based lempel-Ziv LZ77 factorization algorithms},
  author={Anisa Al-Hafeedh and Maxime Crochemore and Lucian Ilie and Evguenia Kopylova and William F. Smyth and German Tischler and Munina Yusufu},
  journal={ACM Comput. Surv.},
  year={2012},
  volume={45},
  pages={5:1-5:17}
}
Since 1977, when Lempel and Ziv described a kind of string factorization useful for text compression, there has been a succession of algorithms proposed for computing “LZ factorization”. In particular, there have been several recent algorithms proposed that extend the usefulness of LZ factorization, for example, to the calculation of maximal repetitions. In this article, we provide an overview of these new algorithms and compare their efficiency in terms of their usage of time and space. 
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-6 of 6 references

DivSufSort

  • Y. MORI
  • http://code.google.com/p/libdivsufsort/.
  • 2005
Highly Influential
4 Excerpts

The maximum number of runs in a string

  • F. FRANEK, R. J. SIMPSON, W. F. SMYTH
  • Proceedings of the 14th Australasian Workshop on…
  • 2003
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…