基于抗原中介三链DNA结构的0-1整数规划  

0-1 integer programming problem based on RecA-mediated triple-stranded DNA structure

作　　者：杨静[1] 殷志祥[1] 

机构地区：[1]安徽理工大学数理系,安徽淮南232001

出　　处：《计算机工程与应用》2008年第2期76-79,共4页Computer Engineering and Applications

基　　金：国家自然科学基金( the National Natural Science Foundation of China under Grant No.30570431);国家高技术研究发展计划( 863)( the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z104);国家教育部新世纪人才支持计划( the New Century Excellent Talent Foundation from MOE of China under Grant No.NCET- 06- 555);安徽省优秀青年基金( No.06042088);安徽省教育厅自然科学( No.2006kj068A; No.KJ2007B173);安徽省人才基金资助。

摘　　要：利用同源的存在抗原蛋白质的脱氧核苷酸定位于双链DNA中很容易形成三螺旋结构的DNA链,可以利用这种独特的结构来研究一些可能的或可行的的计算模型。尝试了用三螺旋结构的DNA链来解决简单的0-1整数规划问题。而对于整数规划和可满足问题都可以转化为0-1整数规划来解决,从而都可以利用三链DNA计算模型得以解决。Since triple-stranded DNA can be formed readily at any location in double-standed DNA with a homologous deoxyoligonucleotide in the presence of RecA-protein,it can be explored the possibility and feasibility to compute by this unique structure.In this paper the author shows that triple-stranded DNA structure mediated by RecA protein can be used for solving 0- 1 integer programming problem.It can be solved the integer programming problem and satisfiability problem by this model.It can be transformed from integer programming problem and satisfiability problem to 0-1 integer programming problem.

关 键 词：三链DNA 0-1整数规划 DNA计算 

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