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.
| Original language | English |
|---|---|
| Pages (from-to) | 1223-1226 |
| Number of pages | 4 |
| Journal | Science |
| Volume | 288 |
| Issue number | 5469 |
| DOIs | |
| Publication status | Published - 2000 May 19 |
ASJC Scopus subject areas
- General
Fingerprint Dive into the research topics of 'Molecular computation by DNA hairpin formation'. Together they form a unique fingerprint.
Cite this
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & Hagiya, M. (2000). Molecular computation by DNA hairpin formation. Science, 288(5469), 1223-1226. https://doi.org/10.1126/science.288.5469.1223