TY - JOUR
T1 - Molecular computation by DNA hairpin formation
AU - Sakamoto, Kensaku
AU - Gouzu, Hidetaka
AU - Komiya, Ken
AU - Kiga, Daisuke
AU - Yokoyama, Shigeyuki
AU - Yokomori, Takashi
AU - Hagiya, Masami
N1 - Copyright:
Copyright 2007 Elsevier B.V., All rights reserved.
PY - 2000/5/19
Y1 - 2000/5/19
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034685812&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034685812&partnerID=8YFLogxK
U2 - 10.1126/science.288.5469.1223
DO - 10.1126/science.288.5469.1223
M3 - Article
C2 - 10817993
AN - SCOPUS:0034685812
VL - 288
SP - 1223
EP - 1226
JO - Science
JF - Science
SN - 0036-8075
IS - 5469
ER -