基于DNA计算的二元整数规划问题的分子解决方案。
Molecular solutions to the binary integer programming problem based on DNA computation.
作者信息
Yeh Chung-Wei, Chu Chih-Ping, Wu Kee-Rong
机构信息
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, ROC.
出版信息
Biosystems. 2006 Jan;83(1):56-66. doi: 10.1016/j.biosystems.2005.09.005. Epub 2005 Oct 17.
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).
二元优化是整数线性规划中一个被广泛研究的课题。本研究提出了一种基于DNA的计算算法，用于解决规模显著的二元整数规划（BIP）问题。所提出的方法基于阿德尔曼和利普顿的DNA操作来解决BIP问题。考虑到其O(nxk)的运算时间复杂度，DNA计算解决BIP问题的潜力是巨大的。
Zotero 插件