Self-assembling DNA graphs

Authors:
Phiset Sa-Ardyen;Natašsa Jonoska;Nadrian C. Seeman
Affiliations:
New York University, Department of Chemistry, New York, NY 10003, USA (E-mail: ps201@nyu.edu);University of South Florida, Department of Mathematics, Tampa, FL 33620, USA (E-mail: jonoska@math.usf.edu);New York University, Department of Chemistry, New York, NY 10003, USA (E-mail: ned.seeman@nyu.edu)
Venue:
Natural Computing: an international journal
Year:
2003

Citing 3
Cited 4

Horn Clause Computation by Self-assembly of DNA Molecules

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Boundary Components of Thickened Graphs

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNASequencesGenerator: A Program for the Construction of DNA Sequences

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing

On the complexity of graph self-assembly in accretive systems

Natural Computing: an international journal
On aggregation in multiset-based self-assembly of graphs

Natural Computing: an international journal
Flexible versus rigid tile assembly

UC'06 Proceedings of the 5th international conference on Unconventional Computation
On the complexity of graph self-assembly in accretive systems

DNA'06 Proceedings of the 12th international conference on DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been shown theoretically that three dimensional graph structure and DNA self-assembly can be used to solve numerous computational problems such as 3-SAT and 3-colorability in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building blocks. This paper presents experimental results of DNA self-assembly of non regular graphs using junction molecules as vertices and duplex DNA molecules as edge connections.