Simpler and faster Lempel Ziv factorization

Keisuke Goto, Hideo Bannai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

We present a new, simple, and efficient approach for computing the Lempel-Ziv (LZ77) factorization of a string in linear time, based on suffix arrays. Computational experiments on various data sets show that our approach constantly outperforms the fastest previous algorithm LZOG (Ohlebusch and Gog 2011), and can be up to 2 to 3 times faster in the processing after obtaining the suffix array, while requiring the same or a little more space.

Original languageEnglish
Title of host publicationProceedings - DCC 2013
Subtitle of host publication2013 Data Compression Conference
Pages133-142
Number of pages10
DOIs
Publication statusPublished - Aug 8 2013
Event2013 Data Compression Conference, DCC 2013 - Snowbird, UT, United States
Duration: Mar 20 2013Mar 22 2013

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314

Other

Other2013 Data Compression Conference, DCC 2013
CountryUnited States
CitySnowbird, UT
Period3/20/133/22/13

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Simpler and faster Lempel Ziv factorization'. Together they form a unique fingerprint.

  • Cite this

    Goto, K., & Bannai, H. (2013). Simpler and faster Lempel Ziv factorization. In Proceedings - DCC 2013: 2013 Data Compression Conference (pp. 133-142). [6543049] (Data Compression Conference Proceedings). https://doi.org/10.1109/DCC.2013.21