Molecular computation by DNA hairpin formation

Kensaku Sakamoto, Hidetaka Gouzu, Ken Komiya, Daisuke Kiga, Shigeyuki Yokoyama, Takashi Yokomori, Masami Hagiya

研究成果: Article

325 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)1223-1226
ページ数4
ジャーナルScience
288
発行部数5469
DOI
出版物ステータスPublished - 2000 5 19

ASJC Scopus subject areas

  • General

フィンガープリント Molecular computation by DNA hairpin formation' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    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