词中空位重复序列的最优搜索
Optimal searching of gapped repeats in a word
摘要:
根据(Kolpakov等人,二〇一三年; Gawrychowski和Manea,2015),我们继续研究字符串中的{ \em $α$ -缺口重复序列},定义为因子$uvu$与$|uv|\leq α|u|$。我们的主要结果是$O(αn)$与长度为$n$的串中{ \em maximum} $α$ -缺口重复序列的数目有关,先前在(Kolpakov等人,2013年)的报告。对于最大$δ$ -子重复($1+δ$和$2$之间的指数的最大因子)的密切相关的概念,我们的结果暗示了它们的数目上的$O(n/δ)$界,这改进了(Kolpakov等人,2010)通过$\log n$因子。我们还证明了一个算法的时间界限$O(αn+S)$($S$大小的输出)计算所有最大的$α$缺口重复。我们的解决方案受到(Gawrychowski和Manea,2015)的启发,与最近发表的证明不同(Tanimura等人,2015年,同样的结局。连同我们对$S$的约束,这意味着计算所有最大$α$ -缺口重复的$O(αn)$ -时间算法。
英文摘要:
Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of {\em $α$-gapped repeats} in strings, defined as factors $uvu$ with $|uv|\leq α|u|$. Our main result is the $O(αn)$ bound on the number of {\em maximal} $α$-gapped repeats in a string of length $n$, previously proved to be $O(α^2 n)$ in (Kolpakov et al., 2013). For a closely related notion of maximal $δ$-subrepetition (maximal factors of exponent between $1+δ$ and $2$), our result implies the $O(n/δ)$ bound on their number, which improves the bound of (Kolpakov et al., 2010) by a $\log n$ factor. We also prove an algorithmic time bound $O(αn+S)$ ($S$ size of the output) for computing all maximal $α$-gapped repeats. Our solution, inspired by (Gawrychowski and Manea, 2015), is different from the recently published proof by (Tanimura et al., 2015) of the same bound. Together with our bound on $S$, this implies an $O(αn)$-time algorithm for computing all maximal $α$-gapped repeats.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。