Title :
Fast Parallel Molecular Solution to the Hitting-Set Problem
Author :
Shi, Nung-Yue ; Chu, Chih-Ping
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan
Abstract :
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.
Keywords :
DNA; biocomputing; computational complexity; set theory; DNA-based algorithm; NP-complete problem; fast parallel molecular solution; hitting-set problem; set theory; Automatic control; Computer architecture; Computer science; DNA computing; Intelligent systems; Joining processes; NP-complete problem; Robotics and automation; Sequences; Set theory; DNA-based Algorithm; DNA-based Supercomputing; Set Theory; the Hitting-set Problem; the NP-Complete Problems;
Conference_Titel :
Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-0-7695-3382-7
DOI :
10.1109/ISDA.2008.355
