arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.2398cs.CCcs.DScs.FL
收藏

最大广义模式匹配问题的参数化研究

A Parameterized Study of Maximum Generalized Pattern Matching Problems

Sebastian Ordyniak, Alexandru Popa

摘要:

广义函数匹配(GFM)问题从[Eschericht和Rozenberg,1979]开始被深入研究。给定一个模式p和一个文本t,目标是找到从p的字母到t的非空子串的映射,使得将映射应用于p得到t。最近,这个问题已经在参数化复杂性的框架内进行了研究[Fernau,Schmid和Villanger,2013]。在本文中,我们研究了GFM的优化变体(称为Max-GFM)的参数化复杂性,该变体已在[Amir和Nor,2007]中引入。在这里,人们可以用一些特殊的符号来代替一些图案字母“?“,称为通配符或无关紧要,可以映射到文本的任意子字符串。目标是尽量减少使用的通配符数量。我们给出了Max-GFM及其变体的参数复杂性的一个完整分类,在广泛的参数化下,例如,一个字母在文本中出现的次数,文本字母表的大小,一个字母在模式中出现的次数,模式字母表的大小,与任何模式字母匹配的字符串的最大长度,通配符的数量和字符串可以映射到的最大大小。

英文摘要:

The generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 1979]. Given a pattern p and a text t, the goal is to find a mapping from the letters of p to non-empty substrings of t, such that applying the mapping to p results in t. Very recently, the problem has been investigated within the framework of parameterized complexity [Fernau, Schmid, and Villanger, 2013]. In this paper we study the parameterized complexity of the optimization variant of GFM (called Max-GFM), which has been introduced in [Amir and Nor, 2007]. Here, one is allowed to replace some of the pattern letters with some special symbols "?", termed wildcards or don't cares, which can be mapped to an arbitrary substring of the text. The goal is to minimize the number of wildcards used. We give a complete classification of the parameterized complexity of Max-GFM and its variants under a wide range of parameterizations, such as, the number of occurrences of a letter in the text, the size of the text alphabet, the number of occurrences of a letter in the pattern, the size of the pattern alphabet, the maximum length of a string matched to any pattern letter, the number of wildcards and the maximum size of a string that a wildcard can be mapped to.

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

↑