arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.02099cs.DS
收藏

最长保性公因子

Longest Property-Preserved Common Factor

Lorraine A. K Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone

摘要:

在本文中,我们介绍了一个新的家庭的字符串处理问题。给定两个或多个字符串,要求我们计算一个所有字符串共有的因子,该因子保持特定属性并具有最大长度。在这里,我们考虑三个基本的字符串属性:无平方因子,周期因子和回文因子在三个不同的设置,一个属性。在第一个设置中,我们给出一个字符串$x$,我们被要求在$x$上构造一个数据结构,回答以下类型的在线查询:给定字符串$y$,找到$x$和$y$共同的最长无平方因子。在第二个设置中,我们给出了$k$字符串和一个整数$1 < k'\leq k$,并要求我们找到至少$k'$字符串共有的最长周期因子。在第三种情况下,我们有两个字符串,我们被要求找到两个字符串共同的最长回文因子。我们提出了所有设置的线性时间的解决方案。我们期望我们的范例可以扩展到其他字符串属性或设置。

英文摘要:

In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. Here we consider three fundamental string properties: square-free factors, periodic factors, and palindromic factors under three different settings, one per property. In the first setting, we are given a string $x$ and we are asked to construct a data structure over $x$ answering the following type of on-line queries: given string $y$, find a longest square-free factor common to $x$ and $y$. In the second setting, we are given $k$ strings and an integer $1 < k'\leq k$ and we are asked to find a longest periodic factor common to at least $k'$ strings. In the third setting, we are given two strings and we are asked to find a longest palindromic factor common to the two strings. We present linear-time solutions for all settings. We anticipate that our paradigm can be extended to other string properties or settings.

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

↑