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

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

doi:10.4230/LIPIcs.ISAAC.2017.33

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

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

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	28th International Symposium on Algorithms and Computation, ISAAC 2017
Editors	Takeshi Tokuyama, Yoshio Okamoto
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770545
DOIs	https://doi.org/10.4230/LIPIcs.ISAAC.2017.33
Publication status	Published - Dec 1 2017
Event	28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, Thailand Duration: Dec 9 2017 → Dec 22 2017

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	92
ISSN (Print)	1868-8969

Other

Other	28th International Symposium on Algorithms and Computation, ISAAC 2017
Country	Thailand
City	Phuket
Period	12/9/17 → 12/22/17

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.4230/LIPIcs.ISAAC.2017.33

Cite this

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

Almost linear time computation of maximal repetitions in run length encoded strings. / Fujishige, Yuta; Nakashima, Yuto ; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

28th International Symposium on Algorithms and Computation, ISAAC 2017. ed. / Takeshi Tokuyama; Yoshio Okamoto. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 92).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

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

Fujishige, Yuta ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Almost linear time computation of maximal repetitions in run length encoded strings. 28th International Symposium on Algorithms and Computation, ISAAC 2017. editor / Takeshi Tokuyama ; Yoshio Okamoto. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{89f86981d5fa478288220279597141b6,

title = "Almost linear time computation of maximal repetitions in run length encoded strings",

abstract = "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.",

author = "Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",

year = "2017",

month = dec,

day = "1",

doi = "10.4230/LIPIcs.ISAAC.2017.33",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Takeshi Tokuyama and Yoshio Okamoto",

booktitle = "28th International Symposium on Algorithms and Computation, ISAAC 2017",

note = "28th International Symposium on Algorithms and Computation, ISAAC 2017 ; Conference date: 09-12-2017 Through 22-12-2017",

}

TY - GEN

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

AU - Fujishige, Yuta

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2017/12/1

Y1 - 2017/12/1

N2 - 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.

AB - 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.

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

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

U2 - 10.4230/LIPIcs.ISAAC.2017.33

DO - 10.4230/LIPIcs.ISAAC.2017.33

M3 - Conference contribution

AN - SCOPUS:85038564653

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 28th International Symposium on Algorithms and Computation, ISAAC 2017

A2 - Tokuyama, Takeshi

A2 - Okamoto, Yoshio

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

T2 - 28th International Symposium on Algorithms and Computation, ISAAC 2017

Y2 - 9 December 2017 through 22 December 2017

ER -