DNA SOLUTION OF HARD COMPUTATIONAL PROBLEMS

被引：743

作者：

LIPTON, RJ

机构：

[1] Princeton University, Princeton

来源：

SCIENCE | 1995年 / 268卷 / 5210期

关键词：

D O I：

10.1126/science.7725098

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

DNA experiments are proposed to solve the famous ''SAT'' problem of computer science. This is a special case of a more general method that can solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA-based computing. It has the potential to yield vast speedups over conventional electronic-based computers for such search problems.

引用

页码：542 / 545

页数：4