Consensus Patterns parameterized by input string length is W[1]-hard
classification
💻 cs.CC
keywords
inputstringsconsensushardlengthparameterizedpatternsproblem
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.