An algorithm for subset sum problem on molecular computation

DNA computing is a new emerging field of parallel computing. However, DNA computing is mainly based on biological technology, which is prone to deterioration and damage and other issues in the reaction process, so a new scalable GTM subset-sum algorithm which is based on generalized molecular computation model is proposed in this paper. The algorithm is not based on biological technology. And it supports simple arithmetic logic. It can also resolve the subset sum problem in polynomial time. Finally, an example illustrates the validity of the algorithm.