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

no code implementations • 12 Apr 2016 • Giuseppe Lancia, Luke Mathieson, Pablo Moscato

We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings.