The complexities of DNA computation

被引：31

作者：

Cox, JC ^{[1
]}

Cohen, DS

Ellington, AD

机构：

[1] Univ Texas, Inst Cell & Mol Biol, Austin, TX 78712 USA

[2] Univ Texas, Dept Chem & Biochem, Austin, TX 78712 USA

来源：

TRENDS IN BIOTECHNOLOGY | 1999年 / 17卷 / 04期

关键词：

D O I：

10.1016/S0167-7799(99)01312-8

中图分类号：

Q81 [生物工程学（生物技术）]; Q93 [微生物学];

学科分类号：

071005 ; 0836 ; 090102 ; 100705 ;

摘要：

Over the past few years, a handful of insightful researchers have bridged the gap between biological computing theory and actual DNA-based computation. By using ingenious encoding techniques and clever molecular-biological manipulations, simple versions of computationally complex problems have been experimentally approached or resolved. However, the technical problems revealed during the execution of these scientific set pieces make it unlikely that DNA will ever rival silicon for the solution of any real-world problem.

引用

页码：151 / 154

页数：4

共 28 条

[21]

National Institute of Standards and Technology of USA, 1993, FED INF PROC STAND P

[22] DNA solution of the maximal clique problem [J].