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

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference, PSC 2018
編集者Jan Holub, Jan Zdarek
出版社Prague Stringology Club
ページ12-26
ページ数15
ISBN(電子版)9788001064849
出版ステータス出版済み - 2018
イベント22nd Prague Stringology Conference, PSC 2018 - Prague, チェコ共和国
継続期間: 8 27 20188 28 2018

出版物シリーズ

名前Proceedings of the Prague Stringology Conference, PSC 2018

会議

会議22nd Prague Stringology Conference, PSC 2018
国/地域チェコ共和国
CityPrague
Period8/27/188/28/18

All Science Journal Classification (ASJC) codes

  • 数学 (全般)

フィンガープリント

「O(n log n)-time text compression by LZ-style longest first substitution」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル