Self-assembling DNA graphs

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

Research output: Contribution to journalArticle

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

Fingerprint

DNA
Molecules
Self assembly

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Self-assembling DNA graphs. / Sa-Ardyen, Phiset; Jonoska, Nataša; Seeman, Nadrian.

In: Natural Computing, Vol. 2, No. 4, 2003, p. 427-438.

Research output: Contribution to journalArticle

Sa-Ardyen, Phiset ; Jonoska, Nataša ; Seeman, Nadrian. / Self-assembling DNA graphs. In: Natural Computing. 2003 ; Vol. 2, No. 4. pp. 427-438.
@article{97ad3ddbc8394d46894d1cdbd95a1a76,
title = "Self-assembling DNA graphs",
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.",
keywords = "DNA computing, Graphs, Junction molecules, Ligation, Self-assembly",
author = "Phiset Sa-Ardyen and Nataša Jonoska and Nadrian Seeman",
year = "2003",
doi = "10.1023/B:NACO.0000006771.95566.34",
language = "English (US)",
volume = "2",
pages = "427--438",
journal = "Natural Computing",
issn = "1567-7818",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Self-assembling DNA graphs

AU - Sa-Ardyen, Phiset

AU - Jonoska, Nataša

AU - Seeman, Nadrian

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - DNA computing

KW - Graphs

KW - Junction molecules

KW - Ligation

KW - Self-assembly

UR - http://www.scopus.com/inward/record.url?scp=4344647604&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4344647604&partnerID=8YFLogxK

U2 - 10.1023/B:NACO.0000006771.95566.34

DO - 10.1023/B:NACO.0000006771.95566.34

M3 - Article

AN - SCOPUS:4344647604

VL - 2

SP - 427

EP - 438

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 4

ER -