On existence of reporter strands in DNA-based graph structures

Nataša Jonoska, Nadrian Seeman, Gang Wu

Research output: Contribution to journalArticle

Abstract

Through self-assembly of branched junction molecules many different DNA structures (graphs) can be assembled. We show that every multigraph can be assembled by DNA such that there is a single strand that traces each edge in the graph at least once. This strand corresponds to a boundary component of a two-dimensional orientable surface that has the given graph as a deformation retract. This boundary component traverses every edge at least once, and it defines a circular path in the graph that "preserves the graph structure" and traverses each edge.

Original languageEnglish (US)
Pages (from-to)1448-1460
Number of pages13
JournalTheoretical Computer Science
Volume410
Issue number15
DOIs
StatePublished - Apr 1 2009

Fingerprint

DNA
Graph in graph theory
Self assembly
Molecules
Retract
Multigraph
Self-assembly
Trace
Path

Keywords

  • Boundary components
  • DNA graphs
  • Graph structures by DNA
  • Reporter strands
  • Thickened graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

On existence of reporter strands in DNA-based graph structures. / Jonoska, Nataša; Seeman, Nadrian; Wu, Gang.

In: Theoretical Computer Science, Vol. 410, No. 15, 01.04.2009, p. 1448-1460.

Research output: Contribution to journalArticle

Jonoska, Nataša ; Seeman, Nadrian ; Wu, Gang. / On existence of reporter strands in DNA-based graph structures. In: Theoretical Computer Science. 2009 ; Vol. 410, No. 15. pp. 1448-1460.
@article{91f2000c80c54aa4bc6bc3a7c221c6fe,
title = "On existence of reporter strands in DNA-based graph structures",
abstract = "Through self-assembly of branched junction molecules many different DNA structures (graphs) can be assembled. We show that every multigraph can be assembled by DNA such that there is a single strand that traces each edge in the graph at least once. This strand corresponds to a boundary component of a two-dimensional orientable surface that has the given graph as a deformation retract. This boundary component traverses every edge at least once, and it defines a circular path in the graph that {"}preserves the graph structure{"} and traverses each edge.",
keywords = "Boundary components, DNA graphs, Graph structures by DNA, Reporter strands, Thickened graphs",
author = "Nataša Jonoska and Nadrian Seeman and Gang Wu",
year = "2009",
month = "4",
day = "1",
doi = "10.1016/j.tcs.2008.12.004",
language = "English (US)",
volume = "410",
pages = "1448--1460",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "15",

}

TY - JOUR

T1 - On existence of reporter strands in DNA-based graph structures

AU - Jonoska, Nataša

AU - Seeman, Nadrian

AU - Wu, Gang

PY - 2009/4/1

Y1 - 2009/4/1

N2 - Through self-assembly of branched junction molecules many different DNA structures (graphs) can be assembled. We show that every multigraph can be assembled by DNA such that there is a single strand that traces each edge in the graph at least once. This strand corresponds to a boundary component of a two-dimensional orientable surface that has the given graph as a deformation retract. This boundary component traverses every edge at least once, and it defines a circular path in the graph that "preserves the graph structure" and traverses each edge.

AB - Through self-assembly of branched junction molecules many different DNA structures (graphs) can be assembled. We show that every multigraph can be assembled by DNA such that there is a single strand that traces each edge in the graph at least once. This strand corresponds to a boundary component of a two-dimensional orientable surface that has the given graph as a deformation retract. This boundary component traverses every edge at least once, and it defines a circular path in the graph that "preserves the graph structure" and traverses each edge.

KW - Boundary components

KW - DNA graphs

KW - Graph structures by DNA

KW - Reporter strands

KW - Thickened graphs

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

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

U2 - 10.1016/j.tcs.2008.12.004

DO - 10.1016/j.tcs.2008.12.004

M3 - Article

VL - 410

SP - 1448

EP - 1460

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 15

ER -