Chess games: a model for RNA based computation

被引：26

作者：

Cukras, AR

Faulhammer, D

Lipton, RJ

Landweber, LF ^{[1
]}

机构：

[1] Princeton Univ, Dept Ecol & Evolutionary Biol, Princeton, NJ 08542 USA

[2] Princeton Univ, Dept Comp Sci, Princeton, NJ 08542 USA

来源：

BIOSYSTEMS | 1999年 / 52卷 / 1-3期

关键词：

DNA computing; RNA computing; RNase H; knight problem; satisfiability;

D O I：

10.1016/S0303-2647(99)00030-1

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

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. (C) 1999 Elsevier Science Ireland Ltd. All rights reserved.

引用

页码：35 / 45

页数：11

共 12 条

[1] MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].