title: Chess games: a model for RNA based computation.
abstract: Here we develop the theory of RNA computing and a method for solving the 'knight problem' as an instance of a satisfiability (SAT) problem. Using only biological molecules and enzymes as tools, we developed an algorithm for solving the knight problem (3 x 3 chess board) using a 10-bit combinatorial pool and sequential RNase H digestions. The results of preliminary experiments presented here reveal that the protocol recovers far more correct solutions than expected at random, but the persistence of errors still presents the greatest challenge.
authors.affiliation: Department of Ecology and Evolutionary Biology, Princeton University, NJ 08542, USA.
authors.forename: A R
authors.initials: AR
authors.lastname: Cukras
authors.forename: D
authors.initials: D
authors.lastname: Faulhammer
authors.forename: R J
authors.initials: RJ
authors.lastname: Lipton
authors.forename: L F
authors.initials: LF
authors.lastname: Landweber
mesh_terms: D000818:Animals; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D006801:Humans; D008958:Models, Molecular; D012313:RNA / Q000032:analysis* / Q000235:genetics*; D014158:Transcription, Genetic
chemical_list: D012313:RNA