论文部分内容阅读
DNA computing provides a promising approach to attacking a number of computationally combinatorial optimization problems.The domination problems are well-known NP complete problems and are applied widely in many fields.In this paper,we demonstrate the power of DNA-based computing by showing the domination problems can be efficiently solved under sticker model.By generating the solution space using stickers,we present DNA-based algorithms to solve the problems using polynomial number of basic biological operations.