### 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 language | English (US) |
---|---|

Pages (from-to) | 1448-1460 |

Number of pages | 13 |

Journal | Theoretical Computer Science |

Volume | 410 |

Issue number | 15 |

DOIs | |

State | Published - 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

*Theoretical Computer Science*,

*410*(15), 1448-1460. https://doi.org/10.1016/j.tcs.2008.12.004

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

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 410, no. 15, pp. 1448-1460. https://doi.org/10.1016/j.tcs.2008.12.004

}

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

AN - SCOPUS:60649100880

VL - 410

SP - 1448

EP - 1460

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 15

ER -