Computation by Self-assembly of DNA Graphs

  • Authors:

  • Nataš/a Jonoska;Phiset Sa-Ardyen;Nadrian C. Seeman

  • Affiliations:

  • University of South Florida, Department of Mathematics, Tampa, FL 33620, USA/ jonoska@math.usf.edu;New York University, Department of Chemistry, New York, NY 10003, USA/ ps201@nyu.edu;New York University, Department of Chemistry, New York, NY 10003, USA/ ned.seeman@nyu.edu

  • Venue:
  • Genetic Programming and Evolvable Machines
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.