### 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 |

### Keywords

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

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'On existence of reporter strands in DNA-based graph structures'. Together they form a unique fingerprint.

## Cite this

Jonoska, N., Seeman, N. C., & Wu, G. (2009). On existence of reporter strands in DNA-based graph structures.

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