Author(s): Sakamoto K, Gouzu H, Komiya K, Kiga D, Yokoyama S,
Abstract Share this page
Abstract Hairpin formation by single-stranded DNA molecules was exploited in a DNA-based computation in order to explore the feasibility of autonomous molecular computing. An instance of the satisfiability problem, a famous hard combinatorial problem, was solved by using molecular biology techniques. The satisfiability of a given Boolean formula was examined autonomously, on the basis of hairpin formation by the molecules that represent the formula. This computation algorithm can test several clauses in the given formula simultaneously, which could reduce the number of laboratory steps required for computation.
This article was published in Science
and referenced in Journal of Bioequivalence & Bioavailability