On solving 3CNF-satisfiability with an in vivo algorithm.
Several in vitro DNA algorithms have been proposed in the literature for solving various combinatorial search problems. The next logical step is the critical examination of whether or not such computation can be performed within the cellular environment. We consider the possibility of solving 3-conjunctive-normal-form Satisfiability with one possible in vivo algorithm. The exact biological details still remain to be defined and seem beyond the capabilities of current technologies, but perhaps, this will serve as a springboard for further theoretical inquiry into in vivo approaches.
Eng
T L
TL
Massachusetts Institute of Technology, Cambridge 02139, USA. tleng@theory.lcs.mit.edu
D000465:Algorithms; D000818:Animals; D019295:Computational Biology; D004247:DNA / Q000032:analysis* / Q000737:chemistry / Q000235:genetics; D006801:Humans; D008958:Models, Molecular
D004247:DNA