O(n log n)-time text compression by LZ-style longest first substitution

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

1 Citation (Scopus)

Abstract

Mauer et al. [A Lempel-Ziv-style Compression Method for Repetitive Texts, PSC 2017] proposed a hybrid text compression method called LZ-LFS which has both features of Lempel-Ziv 77 factorization and longest first substitution. They showed that LZ-LFS can achieve better compression ratio for repetitive texts, compared to some state-of-the-art compression algorithms. The drawback of Mauer et al.'s method is that their LZ-LFS compression algorithm takes O(n2) time on an input string of length n. In this paper, we show a faster LZ-LFS compression algorithm that works in O(n log n) time. We also propose a simpler version of LZ-LFS that can be computed in O(n) time.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2018
EditorsJan Holub, Jan Zdarek
PublisherPrague Stringology Club
Pages12-26
Number of pages15
ISBN (Electronic)9788001064849
Publication statusPublished - 2018
Event22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic
Duration: Aug 27 2018Aug 28 2018

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2018

Conference

Conference22nd Prague Stringology Conference, PSC 2018
CountryCzech Republic
CityPrague
Period8/27/188/28/18

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'O(n log n)-time text compression by LZ-style longest first substitution'. Together they form a unique fingerprint.

  • Cite this

    Nishi, A., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2018). O(n log n)-time text compression by LZ-style longest first substitution. In J. Holub, & J. Zdarek (Eds.), Proceedings of the Prague Stringology Conference, PSC 2018 (pp. 12-26). (Proceedings of the Prague Stringology Conference, PSC 2018). Prague Stringology Club.