On the size of overlapping Lempel-Ziv and Lyndon factorizations

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

Lempel-Ziv (LZ) factorization and Lyndon factorization are well-known factorizations of strings. Recently, Kärkkäinen et al. studied the relation between the sizes of the two factorizations, and showed that the size of the Lyndon factorization is always smaller than twice the size of the non-overlapping LZ factorization [STACS 2017]. In this paper, we consider a similar problem for the overlapping version of the LZ factorization. Since the size of the overlapping LZ factorization is always smaller than the size of the non-overlapping LZ factorization and, in fact, can even be an O(log n) factor smaller, it is not immediately clear whether a similar bound as in previous work would hold. Nevertheless, in this paper, we prove that the size of the Lyndon factorization is always smaller than four times the size of the overlapping LZ factorization.

元の言語英語
ホスト出版物のタイトル30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
編集者Nadia Pisanti, Solon P. Pissis
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771030
DOI
出版物ステータス出版済み - 6 1 2019
イベント30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, イタリア
継続期間: 6 18 20196 20 2019

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
128
ISSN(印刷物)1868-8969

会議

会議30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
イタリア
Pisa
期間6/18/196/20/19

Fingerprint

Factorization

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Urabe, Y., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). On the size of overlapping Lempel-Ziv and Lyndon factorizations. : N. Pisanti, & S. P. Pissis (版), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 [29] (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 128). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2019.29

On the size of overlapping Lempel-Ziv and Lyndon factorizations. / Urabe, Yuki; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. 版 / Nadia Pisanti; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 29 (Leibniz International Proceedings in Informatics, LIPIcs; 巻 128).

研究成果: 著書/レポートタイプへの貢献会議での発言

Urabe, Y, Nakashima, Y, Inenaga, S, Bannai, H & Takeda, M 2019, On the size of overlapping Lempel-Ziv and Lyndon factorizations. : N Pisanti & SP Pissis (版), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019., 29, Leibniz International Proceedings in Informatics, LIPIcs, 巻. 128, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, イタリア, 6/18/19. https://doi.org/10.4230/LIPIcs.CPM.2019.29
Urabe Y, Nakashima Y, Inenaga S, Bannai H, Takeda M. On the size of overlapping Lempel-Ziv and Lyndon factorizations. : Pisanti N, Pissis SP, 編集者, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 29. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2019.29
Urabe, Yuki ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / On the size of overlapping Lempel-Ziv and Lyndon factorizations. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. 編集者 / Nadia Pisanti ; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{e3d68699f4ce472a8d22c42cd885f4ff,
title = "On the size of overlapping Lempel-Ziv and Lyndon factorizations",
abstract = "Lempel-Ziv (LZ) factorization and Lyndon factorization are well-known factorizations of strings. Recently, K{\"a}rkk{\"a}inen et al. studied the relation between the sizes of the two factorizations, and showed that the size of the Lyndon factorization is always smaller than twice the size of the non-overlapping LZ factorization [STACS 2017]. In this paper, we consider a similar problem for the overlapping version of the LZ factorization. Since the size of the overlapping LZ factorization is always smaller than the size of the non-overlapping LZ factorization and, in fact, can even be an O(log n) factor smaller, it is not immediately clear whether a similar bound as in previous work would hold. Nevertheless, in this paper, we prove that the size of the Lyndon factorization is always smaller than four times the size of the overlapping LZ factorization.",
author = "Yuki Urabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2019",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.CPM.2019.29",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Nadia Pisanti and Pissis, {Solon P.}",
booktitle = "30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019",

}

TY - GEN

T1 - On the size of overlapping Lempel-Ziv and Lyndon factorizations

AU - Urabe, Yuki

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2019/6/1

Y1 - 2019/6/1

N2 - Lempel-Ziv (LZ) factorization and Lyndon factorization are well-known factorizations of strings. Recently, Kärkkäinen et al. studied the relation between the sizes of the two factorizations, and showed that the size of the Lyndon factorization is always smaller than twice the size of the non-overlapping LZ factorization [STACS 2017]. In this paper, we consider a similar problem for the overlapping version of the LZ factorization. Since the size of the overlapping LZ factorization is always smaller than the size of the non-overlapping LZ factorization and, in fact, can even be an O(log n) factor smaller, it is not immediately clear whether a similar bound as in previous work would hold. Nevertheless, in this paper, we prove that the size of the Lyndon factorization is always smaller than four times the size of the overlapping LZ factorization.

AB - Lempel-Ziv (LZ) factorization and Lyndon factorization are well-known factorizations of strings. Recently, Kärkkäinen et al. studied the relation between the sizes of the two factorizations, and showed that the size of the Lyndon factorization is always smaller than twice the size of the non-overlapping LZ factorization [STACS 2017]. In this paper, we consider a similar problem for the overlapping version of the LZ factorization. Since the size of the overlapping LZ factorization is always smaller than the size of the non-overlapping LZ factorization and, in fact, can even be an O(log n) factor smaller, it is not immediately clear whether a similar bound as in previous work would hold. Nevertheless, in this paper, we prove that the size of the Lyndon factorization is always smaller than four times the size of the overlapping LZ factorization.

UR - http://www.scopus.com/inward/record.url?scp=85068053458&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068053458&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CPM.2019.29

DO - 10.4230/LIPIcs.CPM.2019.29

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019

A2 - Pisanti, Nadia

A2 - Pissis, Solon P.

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -