Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
