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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call