基于DNA链置换与荧光标记的0-1规划问题的计算模型  

A Computing Model Based on DNA Strand Replacement/Fluorescence Labeling for 0-1 Programming

作　　者：马丽娜[1] 董亚非[1] 张成[2] 刘西奎[3] 

机构地区：[1]陕西师范大学生命科学学院,陕西西安710062 [2]北京大学信息科学技术学院,北京100871 [3]山东科技大学信息科学与工程学院,山东青岛266590

出　　处：《数学的实践与认识》2013年第11期152-159,共8页Mathematics in Practice and Theory

基　　金：国家自然科学基金(61170054;60970005;61173113;61272246)

摘　　要：DNA链置换技术和荧光标记是近年生物计算领域的新兴的方法,并且因为它们都有着操作简单的优势而成为DNA计算的常用方法.DNA自组装算法是以DNA分子作为数据存储和运算的一种新型计算模式.为了提高算法的特异性和检测的灵敏度,在自组装算法的基础上,首次将DNA链置换技术和荧光标记结合引入到自组装模型中,提出了一个解决0-1规划问题的DNA计算新模型.与以往DNA计算模型相比,该模型提高了运算的可靠性和准确性,而且可以逐步缩小解空间,降低运算的复杂度,同时也使检测的方法更加灵活,易于引入到其他自组装算法模型中.DNA strand replacement and fluorescence labeling are new technique in the area of biological computing. And they both have the advantage of operating simply, so they be- came common methods in DNA computing.DNA Self-assembly algorithm is a new computing model based on molecule which is regard as data storage and operator. In order to improve the specificity and detection sensitivity of self-assembly algorithm, we introduced both DNA strand replacement technique and fluorescence labeling into the self-assembly algorithm for the first time, and proposed a new DNA computing model to solve 0-1 programming problem. Compared with the previous DNA computing model, The model have some significant advan- rages such as improving the reliability and accuracy of the arithmetic, and it can reduce the solution space gradually, thereby reduced the complexity of operation, furthermore, it make the detection method flexibly, and easy to be used for the other self-assembly algorithm model.

关 键 词：DNA链置换 荧光标记 0-1规划 自组装算法 

分 类 号：O221.4[理学—运筹学与控制论] Q523[理学—数学]