Journal
SCIENCE
Volume 288, Issue 5469, Pages 1223-1226Publisher
AMER ASSOC ADVANCEMENT SCIENCE
DOI: 10.1126/science.288.5469.1223
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available