CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Separating sets of strings by finding matching patterns is almost always hard
Authors
G Lancia
L Mathieson
P Moscato
Publication date
18 December 2016
Publisher
'Elsevier BV'
Doi
Cite
View
on
arXiv
Abstract
© 2017 Elsevier B.V. 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
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
OPUS - University of Technology Sydney
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:opus.lib.uts.edu.au:10453/...
Last time updated on 18/10/2019
Institutional Research Information System
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:air.uniud.it:11390/1127145
Last time updated on 17/04/2020
Archivio istituzionale della ricerca - Università degli Studi di Udine
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:air.uniud.it:11390/1127145
Last time updated on 10/04/2018
University of Newcastle's Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 13/10/2017