Computation by Self-assembly of DNA Graphs |
| |
Authors: | NataŠa Jonoska Phiset Sa-Ardyen Nadrian C Seeman |
| |
Affiliation: | (1) Department of Mathematics, University of South Florida, Tampa, FL 33620, USA;(2) Department of Chemistry, New York University, New York, NY 10003, USA |
| |
Abstract: | Using three dimensional graph structure and DNA self-assembly we show that theoretically 3-SAT and 3-colorability can be solved
in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building
blocks. The graphs involved are not necessarily regular, so experimental results of self-assembling non regular graphs using
junction molecules as vertices and duplex DNA molecules as edge connections are presented. |
| |
Keywords: | DNA-computing self-assembly junction molecules ligation 3-SAT graphs |
本文献已被 SpringerLink 等数据库收录! |
|