Consensus Patterns parameterized by input string length is W[1]-hard
Computational Complexity
2017-02-28 v1
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.
Cite
@article{arxiv.1702.08238,
title = {Consensus Patterns parameterized by input string length is W[1]-hard},
author = {Laurent Bulteau},
journal= {arXiv preprint arXiv:1702.08238},
year = {2017}
}