Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (2): 76-79.

• 学术探讨 • Previous Articles     Next Articles

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

YANG Jing,YIN Zhi-xiang   

  1. Department of Mathematics and Physics,Anhui University of Science and Technology,Huainan,Anhui 232001,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-11 Published:2008-01-11
  • Contact: YANG Jing

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

杨 静,殷志祥   

  1. 安徽理工大学 数理系,安徽 淮南 232001
  • 通讯作者: 杨 静

Abstract: 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.

Key words: triple-stranded DNA, 0-1 integer programming problem, DNA computing

摘要: 利用同源的存在抗原蛋白质的脱氧核苷酸定位于双链DNA中很容易形成三螺旋结构的DNA链,可以利用这种独特的结构来研究一些可能的或可行的的计算模型。尝试了用三螺旋结构的DNA链来解决简单的0-1整数规划问题。而对于整数规划和可满足问题都可以转化为0-1整数规划来解决,从而都可以利用三链DNA计算模型得以解决。

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