Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.
This paper demonstrates that basic biological operations can be used to solve the set-partition problem. In order to achieve this, we propose three DNA-based algorithms, a signed parallel adder, a signed parallel subtractor and a signed parallel comparator, that formally verify our designed molecular solutions for solving the set-partition problem.
Chang
Weng-Long
WL
Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan, R.O.C. changwl@cc.kuas.edu.tw
D000465:Algorithms; D001185:Artificial Intelligence; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods; D003198:Computer Simulation; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry* / Q000235:genetics; D009716:Numerical Analysis, Computer-Assisted
D004247:DNA