arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.1307cs.DS
收藏

确定二次时间中弦的全部交换周期及相关问题

Identifying all abelian periods of a string in quadratic time and relevant problems

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos

摘要:

弦的阿贝尔周期性在过去的几年里得到了广泛的研究。在2006年Constantinescu和Ilie定义了一个字符串的阿贝尔周期,并给出了几个计算字符串所有阿贝尔周期的算法。与词的古典时期相比,它的阿贝尔版本更灵活,词的因子在其字母的任何内部排列下都被认为是相同的。我们给出了两个O(|y| ^2)算法来计算字符串y的所有阿贝尔周期。第一种方法将每个字母映射到一个合适的数字,使得字符串的每个因子可以通过与其字母对应的数字的唯一和来识别,从而可以容易地识别阿贝尔周期。另一种是将每个字母映射到一个素数,这样字符串的每个因子都可以通过与其字母对应的数字的唯一乘积来识别,因此可以很容易地识别阿贝尔周期。我们还定义了弱阿贝尔周期的字符串,并给出了一个O(|y| log(|y|))算法计算它们,以及其他一些更基本的问题的算法。

英文摘要:

Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for the computation of all abelian periods of a string were given. In contrast to the classical period of a word, its abelian version is more flexible, factors of the word are considered the same under any internal permutation of their letters. We show two O(|y|^2) algorithms for the computation of all abelian periods of a string y. The first one maps each letter to a suitable number such that each factor of the string can be identified by the unique sum of the numbers corresponding to its letters and hence abelian periods can be identified easily. The other one maps each letter to a prime number such that each factor of the string can be identified by the unique product of the numbers corresponding to its letters and so abelian periods can be identified easily. We also define weak abelian periods on strings and give an O(|y|log(|y|)) algorithm for their computation, together with some other algorithms for more basic problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑