科研之友
微信
新浪微博
Facebook
分享链接
摘要
The set splitting problem is to find a subset in a given set, that the sum of the subset is half of the whole set. In this paper, we present a DNA algorithm for solving set splitting problem with DNA molecular operations. For a set with n elements, we reasonably design fixed length DNA strands representing elements of the set, take appropriate steps and get the solutions of the set splitting problem in proper length range using O(n) time complexity.
