Repetition Detection in a Dynamic String
Repetition Detection in a Dynamic String
复制标题
动态字符串中的重复检测
DOI：
10.4230/lipics.esa.2019.5
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Eitan Kondratovsky
中科院分区：
文献类型：
--
作者：
A. Amir;Itai Boneh;P. Charalampopoulos;Eitan Kondratovsky
非空字符串U的字符串UU被称为正方形。最多n的动态字符串。 o（输出）时间的S平方弦。 ）已知字符串。字符串。
A string UU for a non-empty string U is called a square. Squares have been well-studied both from a combinatorial and an algorithmic perspective. In this paper, we are the first to consider the problem of maintaining a representation of the squares in a dynamic string S of length at most n. We present an algorithm that updates this representation in no(1) time. This representation allows us to report a longest square-substring of S in O(1) time and all square-substrings of S in O(output) time. We achieve this by introducing a novel tool – maintaining prefix-suffix matches of two dynamic strings. We extend the above result to address the problem of maintaining a representation of all runs (maximal repetitions) of the string. Runs are known to capture the periodic structure of a string, and, as an application, we show that our representation of runs allows us to efficiently answer periodicity queries for substrings of a dynamic string. These queries have proven useful in static pattern matching problems and our techniques have the potential of offering solutions to these problems in a dynamic text setting. 2012 ACM Subject Classification Theory of computation → Pattern matching
重温最重的诱发祖先问题
DOI：
10.4230/lipics.cpm.2018.20
发表时间：
2018
期刊：
{CPM} 2018
影响因子：
--
作者：
Abedin, P.;Hooshmand, S.;Ganguly, A.;Thankachan, S.V.
通讯作者：
Thankachan, S.V.