Almost linear time computation of maximal repetitions in run length encoded strings

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

抜粋

We consider the problem of computing all maximal repetitions contained in a string that is given in run-length encoding. Given a run-length encoding of a string, we show that the maximum number of maximal repetitions contained in the string is at most m+k-1, where m is the size of the run-length encoding, and k is the number of run-length factors whose exponent is at least 2. We also show an algorithm for computing all maximal repetitions in O(m α (m)) time and O(m) space, where α denotes the inverse Ackermann function.

元の言語英語
ホスト出版物のタイトル28th International Symposium on Algorithms and Computation, ISAAC 2017
編集者Takeshi Tokuyama, Yoshio Okamoto
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770545
DOI
出版物ステータス出版済み - 12 1 2017
イベント28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, タイ
継続期間: 12 9 201712 22 2017

出版物シリーズ

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

その他

その他28th International Symposium on Algorithms and Computation, ISAAC 2017
タイ
Phuket
期間12/9/1712/22/17

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2017). Almost linear time computation of maximal repetitions in run length encoded strings. : T. Tokuyama, & Y. Okamoto (版), 28th International Symposium on Algorithms and Computation, ISAAC 2017 (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 92). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2017.33