DNA Solution of Hard Computational Problems

作者：Richard J. Lipton · 发表于：Science · 年份：1995 · DOI：10.1126/science.7725098 · 被引用次数：1056 · 研究领域：DNA and Biological Computing、Advanced biosensing and bioanalysis techniques、Machine Learning and Algorithms

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.