title: Molecular solutions for the subset-sum problem on DNA-based supercomputing.
abstract: In this paper our main purpose is to give molecular solutions for the subset-sum problem. In order to achieve this, we propose a DNA-based algorithm of an n-bit parallel adder and a DNA-based algorithm of an n-bit parallel comparator to formally verify our designed molecular solutions for the subset-sum problem.
authors.affiliation: Department of Information Management, Southern Taiwan University of Technology, Tainan County 710, Taiwan, ROC. changwl@mail.stut.edu.tw
authors.forename: Weng-Long
authors.initials: WL
authors.lastname: Chang
authors.forename: Michael Shan-Hui
authors.initials: MS
authors.lastname: Ho
authors.forename: Minyi
authors.initials: M
authors.lastname: Guo
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D003198:Computer Simulation; D039301:Computers, Molecular / Q000592:standards; D004247:DNA / Q000737:chemistry / Q000235:genetics*; D008957:Models, Genetic
chemical_list: D004247:DNA