论文标题
最长（亚）周期性子序列
Longest (Sub-)Periodic Subsequence
论文作者
论文摘要
我们提出了一种算法计算，该算法是$ o（n^7）$ o（n^4）$空间单词的长度$ n $ in $ o（n^7）$ time的最长定期子序列。在限制指数或扩展搜索时，我们会获得改进，从而使报告的子序列降至$ o（n^3）$ time和$ o（n^2）$（n^2）$。
We present an algorithm computing the longest periodic subsequence of a string of length $n$ in $O(n^7)$ time with $O(n^4)$ words of space. We obtain improvements when restricting the exponents or extending the search allowing the reported subsequence to be subperiodic down to $O(n^3)$ time and $O(n^2)$ words of space.
