Fast Parallel Molecular Solution to the Hitting-Set Problem

The hitting-set problem is an NP-complete problem in set theory. Assume that we have collection C of subsets of a finite set S, and a positive integer K les |S|, and we would like to know if there is a subset S' sube S with |S'| les K such that S' hits (contains) at least one element...

Full description

Saved in:
Bibliographic Details
Published in2008 Eighth International Conference on Intelligent Systems Design and Applications Vol. 3; pp. 442 - 447
Main Authors Nung-Yue Shi, Chih-Ping Chu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2008
Subjects
Automatic control
Computer architecture
Computer science
DNA computing
DNA-based Algorithm
DNA-based Supercomputing
Intelligent systems
Joining processes
NP-complete problem
Robotics and automation
Sequences
Set theory
the Hitting-set Problem
the NP-Complete Problems
Online AccessGet full text
ISBN9780769533827
0769533825
ISSN2164-7143
DOI10.1109/ISDA.2008.355

Cover

More Information
Summary:The hitting-set problem is an NP-complete problem in set theory. Assume that we have collection C of subsets of a finite set S, and a positive integer K les |S|, and we would like to know if there is a subset S' sube S with |S'| les K such that S' hits (contains) at least one element from each subset in C. In this paper, the DNA-based algorithm is proposed to solve the hitting-set problem. Furthermore, the simulated experiment is applied to verify correction of the proposed DNA-based algorithm for solving the hitting-set problem.
ISBN:9780769533827
0769533825
ISSN:2164-7143
DOI:10.1109/ISDA.2008.355