Fast parallel DNA algorithms for domination in graph
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.
DNA computing dominating set NP-complete problem Adleman-Lipton model sticker
Xudong Tu Qiongsun Liu
College of Mathmatics and Physics,Chongqing University,Chongqing 400044,China
国内会议
济南
英文
263-278
2009-05-15（万方平台首次上网日期，不代表论文的发表时间）