Solution of a SAT Problem on a Photochemical DNA Computer

Access this Article

Search this Article

Author(s)

    • OGASAWARA Shinzi
    • The School of Material Science, Japan Advanced Institute of Science and Technology
    • FUJIMOTO Kenzo
    • The School of Material Science, Japan Advanced Institute of Science and Technology

Abstract

The photochemical DNA computing via 5-carboxyvinyl-deoxyuridine (<SUP>cv</SUP>U) in anchor oligodeoxynucleotides (ODNs) in order to tether the multiple “DNA words” was demonstrated. A new MARK and UNMARK operation based on the <SUP>cv</SUP>U mediated reversible DNA photoligation has been developed for multiple-words DNA computing. The utility of this operation for DNA computing was demonstrated by solving a satisfiability problem (SAT problem) in which information was encoded in three tandem words.

Journal

  • Chemistry Letters

    Chemistry Letters 34(3), 378-379, 2005-03-05

    The Chemical Society of Japan

References:  12

Cited by:  2

Codes

  • NII Article ID (NAID)
    10014464673
  • NII NACSIS-CAT ID (NCID)
    AA00603318
  • Text Lang
    ENG
  • Article Type
    Journal Article
  • ISSN
    03667022
  • Data Source
    CJP  CJPref  J-STAGE 
Page Top