Molecular solutions to the binary integer programming problem based on DNA computation.
Binary optimization is a widely investigated topic in integer linear programming. This study proposes a DNA-based computing algorithm for solving the significantly large binary integer programming (BIP) problem. The proposed approach is based upon Adleman and Lipton's DNA operations to solve the BIP problem. The potential of DNA computation for the BIP problem is promising given the operational time complexity of O(nxk).
Yeh
Chung-Wei
CW
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, ROC.
Chu
Chih-Ping
CP
Wu
Kee-Rong
KR
D000465:Algorithms; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry* / Q000235:genetics; D008957:Models, Genetic; D012984:Software
D004247:DNA