28
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Molecular computation: RNA solutions to chess problems.

      Proceedings of the National Academy of Sciences of the United States of America
      Algorithms, Combinatorial Chemistry Techniques, Computational Biology, DNA, chemistry, Games, Experimental, Oligodeoxyribonucleotides, Polymerase Chain Reaction, RNA, Ribonucleases

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We have expanded the field of "DNA computers" to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the "Knight problem," which asks generally what configurations of knights can one place on an n x n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 x 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine "bits" or placeholders in a combinatorial RNA library. We recovered a set of "winning" molecules that describe solutions to this problem.

          Related collections

          Author and article information

          Journal
          10677471
          26442
          10.1073/pnas.97.4.1385

          Chemistry
          Algorithms,Combinatorial Chemistry Techniques,Computational Biology,DNA,chemistry,Games, Experimental,Oligodeoxyribonucleotides,Polymerase Chain Reaction,RNA,Ribonucleases

          Comments

          Comment on this article