On existence of reporter strands in DNA-based graph structures

Nataša Jonoska, Nadrian C. 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

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