When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.33
URN: urn:nbn:de:0030-drops-82610
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8261/
 Go to the corresponding LIPIcs Volume Portal

### Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings

 pdf-format:

### 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 \alpha(m)) time and O(m) space, where \alpha denotes the inverse Ackermann function.

### BibTeX - Entry

@InProceedings{fujishige_et_al:LIPIcs:2017:8261,
author =	{Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
title =	{{Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings}},
booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages =	{33:1--33:12},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-054-5},
ISSN =	{1868-8969},
year =	{2017},
volume =	{92},
editor =	{Yoshio Okamoto and Takeshi Tokuyama},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},