Self-assembling DNA graphs

Phiset Sa-Ardyen, Nataša Jonoska, Nadrian C. Seeman

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)427-438
Number of pages12
JournalNatural Computing
Volume2
Issue number4
DOIs
StatePublished - 2003

Keywords

  • DNA computing
  • Graphs
  • Junction molecules
  • Ligation
  • Self-assembly

ASJC Scopus subject areas

  • Computer Science Applications

Fingerprint Dive into the research topics of 'Self-assembling DNA graphs'. Together they form a unique fingerprint.

Cite this