Reports

DNA solution of hard computational problems

Science  28 Apr 1995:
Vol. 268, Issue 5210, pp. 542-545
DOI: 10.1126/science.7725098

Abstract

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.

Related Content