Molecular computation by DNA hairpin formation

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

    Research output: Contribution to journalArticle

    314 Citations (Scopus)

    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 languageEnglish
    Pages (from-to)1223-1226
    Number of pages4
    JournalScience
    Volume288
    Issue number5469
    DOIs
    Publication statusPublished - 2000 May 19

    Fingerprint

    Molecular Computers
    Single-Stranded DNA
    Molecular Biology
    DNA

    ASJC Scopus subject areas

    • General

    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

    Molecular computation by DNA hairpin formation. / Sakamoto, Kensaku; Gouzu, Hidetaka; Komiya, Ken; Kiga, Daisuke; Yokoyama, Shigeyuki; Yokomori, Takashi; Hagiya, Masami.

    In: Science, Vol. 288, No. 5469, 19.05.2000, p. 1223-1226.

    Research output: Contribution to journalArticle

    Sakamoto, K, Gouzu, H, Komiya, K, Kiga, D, Yokoyama, S, Yokomori, T & Hagiya, M 2000, 'Molecular computation by DNA hairpin formation', Science, vol. 288, no. 5469, pp. 1223-1226. https://doi.org/10.1126/science.288.5469.1223
    Sakamoto K, Gouzu H, Komiya K, Kiga D, Yokoyama S, Yokomori T et al. Molecular computation by DNA hairpin formation. Science. 2000 May 19;288(5469):1223-1226. https://doi.org/10.1126/science.288.5469.1223
    Sakamoto, Kensaku ; Gouzu, Hidetaka ; Komiya, Ken ; Kiga, Daisuke ; Yokoyama, Shigeyuki ; Yokomori, Takashi ; Hagiya, Masami. / Molecular computation by DNA hairpin formation. In: Science. 2000 ; Vol. 288, No. 5469. pp. 1223-1226.
    @article{7e6b4e9f72074af1b6d9a670081a3542,
    title = "Molecular computation by DNA hairpin formation",
    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.",
    author = "Kensaku Sakamoto and Hidetaka Gouzu and Ken Komiya and Daisuke Kiga and Shigeyuki Yokoyama and Takashi Yokomori and Masami Hagiya",
    year = "2000",
    month = "5",
    day = "19",
    doi = "10.1126/science.288.5469.1223",
    language = "English",
    volume = "288",
    pages = "1223--1226",
    journal = "Science",
    issn = "0036-8075",
    publisher = "American Association for the Advancement of Science",
    number = "5469",

    }

    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

    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 -