Ontology highlight
ABSTRACT:
SUBMITTER: Faulhammer D
PROVIDER: S-EPMC26442 | biostudies-literature | 2000 Feb
REPOSITORIES: biostudies-literature
Faulhammer D D Cukras A R AR Lipton R J RJ Landweber L F LF
Proceedings of the National Academy of Sciences of the United States of America 20000201 4
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 ch ...[more]