Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem.
In this paper our main purpose is to give molecular solutions for the subset-product problem. In order to achieve this, we propose three DNA-based algorithms--parallel adder, parallel multiplier and parallel comparator--that formally verify our designed molecular solutions for the subset-product problem. We also show that Boolean circuits are not needed to perform mathematical operations on a molecular computer. Furthermore, this work indicates that the subset-product problem is solved and also presents clear evidence of the ability of molecular computing to perform complicated mathematical operations.
Ho
Michael Shan-Hui
MS
Department of Information Management, Southern Taiwan University of Technology, Taiwan 710, ROC. MHoInCerritos@yahoo.com
D000465:Algorithms; D019295:Computational Biology / Q000295:instrumentation / Q000379:methods*; D003201:Computers; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry / Q000235:genetics*; D009154:Mutation; D012984:Software; D049490:Systems Biology / Q000379:methods
D004247:DNA