Molecular computation: RNA solutions to chess problems

AUTOR(ES)

Faulhammer, Dirk

FONTE

The National Academy of Sciences

RESUMO

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 × 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 × 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.

Documentos Relacionados

• Understanding biological computation: reliable learning and recognition.
• Bringing biological solutions to chemical problems*
• Artificial Solutions to Health Care Problems
• Encoding for computation: Recognizing brief dynamical patterns by exploiting effects of weak rhythms on action-potential timing
• Arterial switch operation. Surgical solutions to complex problems.