由输入字符串长度参数化的共识模式是W[1]-hard
Consensus Patterns parameterized by input string length is W[1]-hard
摘要:
我们考虑共识模式问题,其中,给定一组输入字符串,要求提取一个足够长的模式,该模式出现在所有字符串中(有一些错误)。我们证明了这个问题是W[1]-困难的参数时,输入字符串的最大长度。
英文摘要:
We consider the Consensus Patterns problem, where, given a set of input strings, one is asked to extract a long-enough pattern which appears (with some errors) in all strings. We prove that this problem is W[1]-hard when parameterized by the maximum length of input strings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。