Name
Abstract | ||
|---|---|---|
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in understanding the complexity of genetic algorithms. We show that the basic problem of finding a small set of patterns that match one set of strings but do not match any string in a second set is difficult (NP-complete, W[2]-hard when parameterized by the size of the pattern set, and APX-hard). We then perform a detailed parameterized analysis of the problem, separating tractable and intractable variants. In particular we show that parameterizing by the size of pattern set and the number of strings, and the size of the alphabet and the number of strings give FPT results, amongst others. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Computational Complexity | Discrete mathematics,Combinatorics,Parameterized complexity,Almost surely,Small set,Genetic algorithm,Mathematics,Alphabet |
DocType | Volume | Citations |
Journal | abs/1604.03243 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giuseppe Lancia | 1 | 969 | 99.70 |
| Luke Mathieson | 2 | 92 | 11.92 |
| Pablo Moscato | 3 | 334 | 37.27 |