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

汉明距离下的可变模式匹配

Matching Patterns with Variables under Hamming Distance

Paweł Gawrychowski, Florin Manea, Stefan Siemer

摘要:

模式$α$是由变量和终止字母组成的字符串。我们说$α$匹配一个词$w$,它只由终端字母组成,如果$w$可以通过用终端词替换$α$的变量来获得。匹配问题,即,决定一个给定的模式是否匹配一个给定的词,被大量研究:它通常是NP完全的,但可以有效地解决具有限制结构的模式类。在本文中,我们接近这个问题在一个广义的设置,考虑近似模式匹配下的汉明距离。更确切地说,我们感兴趣的是$w$和通过用终端词替换$α$的变量而获得的任何词$u$之间的最小汉明距离是多少。首先,我们解决了一类规则模式(其中没有变量出现两次),并提出了有效的算法,这个问题,以及匹配的条件下界。我们表明,如果我们允许重复的变量,但限制的方式不同的变量可以交错根据局部参数的问题仍然可以有效地解决。然而,只要我们允许一个变量出现不止一次,并且它的出现可以与其他变量的出现任意交错,即使它们都没有出现不止一次,问题就变得棘手了。

英文摘要:

A pattern $α$ is a string of variables and terminal letters. We say that $α$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $α$ by terminal words. The matching problem, i.e., deciding whether a given pattern matches a given word, was heavily investigated: it is NP-complete in general, but can be solved efficiently for classes of patterns with restricted structure. In this paper, we approach this problem in a generalized setting, by considering approximate pattern matching under Hamming distance. More precisely, we are interested in what is the minimum Hamming distance between $w$ and any word $u$ obtained by replacing the variables of $α$ by terminal words. Firstly, we address the class of regular patterns (in which no variable occurs twice) and propose efficient algorithms for this problem, as well as matching conditional lower bounds. We show that the problem can still be solved efficiently if we allow repeated variables, but restrict the way the different variables can be interleaved according to a locality parameter. However, as soon as we allow a variable to occur more than once and its occurrences can be interleaved arbitrarily with those of other variables, even if none of them occurs more than once, the problem becomes intractable.

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

↑