文章基本信息

标题：Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings
本地全文：下载
作者：Yuta Fujishige ; Yuto Nakashima ; Shunsuke Inenaga 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：92
页码：33:1-33:12
DOI：10.4230/LIPIcs.ISAAC.2017.33
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：maximal repetitions;run length encoding