Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2018.24
URN: urn:nbn:de:0030-drops-86855
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8685/
Furuya, Isamu ; Nakashima, Yuto ; I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki
Lyndon Factorization of Grammar Compressed Texts Revisited
| pdf-format: |
|
Abstract
We revisit the problem of computing the Lyndon factorization of a string w of length N which is given as a straight line program (SLP) of size n. For this problem, we show a new algorithm which runs in O(P(n, N) + Q(n, N)n log log N) time and O(n log N + S(n, N)) space where P(n, N), S(n,N), Q(n,N) are respectively the pre-processing time, space, and query time of a data structure for longest common extensions (LCE) on SLPs. Our algorithm improves the algorithm proposed by I et al. (TCS '17), and can be more efficient than the O(N)-time solution by Duval (J. Algorithms '83) when w is highly compressible.
BibTeX - Entry
@InProceedings{furuya_et_al:LIPIcs:2018:8685,
author = {Isamu Furuya and Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
title = {{Lyndon Factorization of Grammar Compressed Texts Revisited}},
booktitle = {Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {24:1--24:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2018/8685},
URN = {urn:nbn:de:0030-drops-86855},
doi = {10.4230/LIPIcs.CPM.2018.24},
annote = {Keywords: Lyndon word, Lyndon factorization, Straight line program}
}
| Keywords: | Lyndon word, Lyndon factorization, Straight line program | |
| Seminar: | Annual Symposium on Combinatorial Pattern Matching (CPM 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 18.05.2018 |
