Molecular computation by DNA hairpin formation

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

364 Citations (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.

Original languageEnglish
Pages (from-to)1223-1226
Number of pages4
Issue number5469
Publication statusPublished - 2000 May 19
Externally publishedYes

ASJC Scopus subject areas

  • General


Dive into the research topics of 'Molecular computation by DNA hairpin formation'. Together they form a unique fingerprint.

Cite this