收藏本站
收藏 | 手机打开
二维码
手机客户端打开本文

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.

知网文化
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62982499
  • 010-62783978