基于DNA计算的指派问题  

DNA computing-based algorithm for assignment problems

作　　者：周康[1] 同小军[1] 许进[2] 

机构地区：[1]武汉工业学院数理科学系,湖北武汉430023 [2]华中科技大学控制科学与工程系,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2008年第2期35-38,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60403002);湖北省自然科学基金资助项目(2007ABA407,2005ABA233);湖北省优秀中青年科技创新团队计划资助项目;湖北省教育厅A类项目(2004D005);浙江省自然科学基金资助项目(ZJNSF-Y105654)

摘　　要：给出了推广的闭环DNA计算模型及其生化实验.用闭环DNA计算模型设计出了指派问题的DNA算法.对决策变量进行4组DNA编码来存放决策变量和效益值;通过有目的的终止技术和删除实验得到指派问题的全部可行解;通过批接入实验、电泳实验和检测实验获得最优指派问题的最优解.举例说明了算法的可行性.最后讨论了推广的闭环DNA计算模型的应用前景和不足之处.A popularized model of closed circle deoxyribonucleic acid （DNA） computation is proposed, by which the algorithm for assignment problems is designed. In this algorithm, 4 groups of DNA encoding for each decision-making variable was encoded to deposit each decision-making variable and benefit value; all feasible solutions to assignment problems were obtained by purposive ending technol- ogy and deleting experiments; all the optimized solutions were found by group insert experiment, electrophoresis one and detecting one. The feasibility of the algorithm was explained by some examples. Further application of the popularized model was also discussed.

关 键 词：指派问题 闭环DNA计算模型 批接入实验 有目的的终止技术 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]