[1]葛存旺,谭逸斌,张海黔,等.DNA计算机[J].东南大学学报(自然科学版),2001,31(4):130-134.[doi:10.3969/j.issn.1001-0505.2001.04.030]
 Ge Cunwang,Tan Yibing,Zhang Haiqian,et al.DNA Computer[J].Journal of Southeast University (Natural Science Edition),2001,31(4):130-134.[doi:10.3969/j.issn.1001-0505.2001.04.030]
点击复制

DNA计算机()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
31
期数:
2001年第4期
页码:
130-134
栏目:
计算机科学与工程
出版日期:
2001-07-20

文章信息/Info

Title:
DNA Computer
作者:
葛存旺 谭逸斌 张海黔 顾宁
东南大学吴健雄实验室, 南京 210096
Author(s):
Ge Cunwang Tan Yibing Zhang Haiqian Gu Ning
Chien-Shiung Wu Laboratory, Southeast University, Nanjing 210096, China)
关键词:
DNA计算机 运算过程 DNA组装
Keywords:
DNA computer computing course DNA assembly
分类号:
TP384;Q524.4;O629.74
DOI:
10.3969/j.issn.1001-0505.2001.04.030
摘要:
脱氧核糖核酸(简称DNA)是生物体内的一种具有双螺旋结构的遗传物质.用DNA可以进行运算,即构成的DNA计算机能很快地求解复杂的问题:以DNA编码为信息的载体,DNA计算机中的输入和输出设备都是DNA的链,用一系列二进制的数代表所求问题中的变量,用DNA中特有的寡核苷酸序列表示这些二进制的数,再将DNA利用分子生物学和化学组装技术组装到芯片上,利用DNA杂交化学方法,排除各种代表不正确解的寡核苷酸序列,最后通过聚合酶链式反应(PCR)和各种检测技术读出保留在芯片上的DNA序列.读出的DNA序列所代表的二进制数即为所求问题的解.本文将从DNA运算过程入手,介绍DNA计算机的原理和DNA计算机的若干最新研究进展.
Abstract:
Deoxyribonucleic acid (DNA for short) is a kind of germ plasm with the structure of double helix. DNA computer with DNA operation can now solve difficult problems quite quickly, in which the input and output are both strands of DNA. In DNA computer, the word and number in computing could be encoded in DNA strands in the light of its character of information carrier, and the molecular biology techniques could be used to execute computation operations. The DNA computing comprises making of oligonucleotide sequence, attaching to chip, marking with complementary sequence, destroying the remaining (unmark) single-stranded molecules and reading out the solution. The principle of DNA computer is introduced and some new developments in this field are reviewed.

参考文献/References:

[1] Liu Q,Liman W.DNA computing on surfaces.Nature,2000,403:175~179
[2] Adleman L M.Molecular computation of solutions to combinatorial problems.Science,1994,266:1021~1024
[3] Garey M R,Johnson D S.Computers and Intractability:a guide to the theory of NP-completeness.San Francisco:Freeman W H,1979.35~38
[4] Ouyang Q,Kaplan P D.DNA solution of the maximal clique problem.Science,1997,278:446~449
[5] Baum E.Building an associative memory vastly larger than the brain.Science,1995,268:583~585
[6] Frutos A G.Demonstration of a word design strategy for DNA computing on surfaces. Nucl Acid Res,1997,25:4748~4757
[7] Baskaran N.Uniform amplification of a mixture of deoxyribonucleic acids with varying GC content.Genome Res,1996,6:633~638
[8] Farrell R E.DNA amplification.Immunol Invest,1997,26:3~7
[9] Smith L M.A surface-based approach to DNA computation.J Comput Biol,1998,5:255~267
[10] Kari L,Gloor G.Using DNA to solve the bounded post correspondence problem.Theoretical Computer Science,2000,231:193~203
[11] Wang L,Liu Q.Surface-based DNA computing operations:DESTORY and READOUT.BioSystems,1999,52:189~191
[12] Piotr W,Artur M,Robert N,et al.DNA computing:implementation of data flow logical operations.Future Generation Computer Systems,2001,17:361~378
[13] Mao C,Thomas H L,John H R,et al.Logical computation using algorithmic self-assembly of DNA triple-crossover molecules.Nature,2000,407:493~496
[14] Boneh D,Dunworth C,Lipton R J.DNA based computers II.DIMACS Series in Discrete Mathematics and Theoretical Computer Science,1999,44:163~170
[15] Karp R M,Kenyon C,Waarts O.Error-resilient DNA computation.Random Struct Algor,1999,15:450~466

备注/Memo

备注/Memo:
作者简介:葛存旺,男,1965年生,副教授,博士研究生.
基金项目:国家自然科学基金资助项目(69890220).
更新日期/Last Update: 2001-07-20