Solving the Minimum Kernel Set Problem Based on Biologically DNA Molecular Computing

Abstract

DNA molecular computing has been applied to solve complicated problems, such as path search problems and discrete combinatorial problems. DNA computing has three major advantages: fast parallel computing, low energy loss and high density storage ability. The minimum kernel set problem aims to find kernel sets with minimum vertex number in a given undirected graph. Based on DNA molecular computation, we describes a new DNA algorithm for solving minimum kernel set problem in O(n(2)) time complexity, which greatly reduces the computational complexity.