Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard

04/12/2016
by   Giuseppe Lancia, et al.
0

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.

READ FULL TEXT
research
02/01/2019

Linear-size Suffix Tries for Parameterized Strings

In this paper, we propose a new indexing structure for parameterized str...
research
10/09/2018

Alignments as Compositional Structures

Alignments, i.e., position-wise comparisons of two or more strings or or...
research
01/05/2016

The minimal hitting set generation problem: algorithms and computation

Finding inclusion-minimal "hitting sets" for a given collection of sets ...
research
09/30/2022

Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography

We, for anti-quantum computing, will discuss various number-based string...
research
04/09/2020

Pattern Discovery in Colored Strings

We consider the problem of identifying patterns of interest in colored s...
research
08/10/2019

Large Scale Geometries of Infinite Strings

We introduce geometric consideration into the theory of formal languages...
research
07/12/2021

Finding a Maximum Clique in a Grounded 1-Bend String Graph

A grounded 1-bend string graph is an intersection graph of a set of poly...

Please sign up or login with your details

Forgot password? Click here to reset