期刊文献+

基于抗原中介三链DNA结构的0-1整数规划 被引量:11

0-1 integer programming problem based on RecA-mediated triple-stranded DNA structure
下载PDF
导出
摘要 利用同源的存在抗原蛋白质的脱氧核苷酸定位于双链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.
作者 杨静 殷志祥
出处 《计算机工程与应用》 CSCD 北大核心 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 0-1整数规划 DNA计算 triple-stranded DNA 0-1 integer programming problem DNA computing
  • 相关文献

参考文献8

  • 1Adlenlan L.Molecular computation of solutions to combinatorial problems[J].Science,1994,266(11):1021-1024.
  • 2Lipton R J.DNA solution of hard computation problem[J].Science,1995,268(4):542-545.
  • 3Ouyang Q,Kaplan P D,Liu S M,et al.DNA solution of the maximal clique problem[J].Science,1997,278(17):446-449.
  • 4Head T,Rozenberg G,Bladergroen R B,et al.Computing with DNA by operating on plasmids[J].Biosystems,2000,57(2):87-93.
  • 5Sakamoto K,Gouzu H,Komiya K,et al.Molecular computation by DNA hairpin formation[J].Science,2000,288(5):1223-1226.
  • 6Yin Z X,Zhang F Y,Xu J.The general form of 0-1 programming problem based on DNA computing[J].Biosystems,2003,70(1):73-79.
  • 7张凤月,殷志祥,许进.DNA芯片在0-1规划问题中的应用[J].生物化学与生物物理进展,2003,30(3):412-415. 被引量:16
  • 8Wang Shi-ying,Yang Ai-ming.DNA solution of integer linear programming[J].Applied Mathematics and Compution,2005,170:626-632.

二级参考文献10

  • 1Freund R, Paun G, Rozenberg G, et al. Watson-Crick finite automata. In: Rubin H, Wood D H, eds. DNA based Computers Ⅲ, 48. Philadelphia: American Mathematical Society, 1999. 305-317.
  • 2Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266 (5187): 1021-1023.
  • 3Lipton R J. DNA solution of hard computation problem. Science,1995, 268 (5210): 542-545.
  • 4Ouyang Q, Kaplan P D, Liu S M, et al. DNA solution of the maximal clique problem. Science, 1997, 278 (17) : 446-449.
  • 5Head T, Rozenberg G, Bladergroen R B, et al. Computing with DNA by operating on plasmids. Biosystems, 2000, 57 (2) : 87-93.
  • 6Sakamoto K, Gouzu H, Komiya K, et al. Molecular computation by DNA hairpin formation. Science, 2000, 288 (5) : 1223- 1226.
  • 7Liu Q H, Wang L M, Fruto A G, et al. DNA computing on surfaces. Nature, 2000, 403 (13) : 175- 179.
  • 8Wu H Y. An improved surface-based method for DNA computation. Biosystems, 2001, 59 (1): 1-5.
  • 9Forder S P, Read J L, Pirrung M C, et al. Light-Directed,spatially addreasable parallel chemical synthesis. Science, 1991,251 (4995): 767-773.
  • 10Bondy J A, Murty U S R. Graph Theory With Applications. New York: The Macmillan Press TD, 1976. 28-89.

共引文献15

同被引文献82

引证文献11

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部