DNA graph structures can self-assemble from branched junction molecules to yield solutions to computational problems. Self-assembly of graphs have previously been shown to give polynomial time solutions to hard computational problems such as 3-SAT and k-colorability problems. Jonoska et al. have proposed studying self-assembly of graphs topologically, considering the boundary components of their thickened graphs, which allows for reading the solutions to computational problems through reporter strands. We discuss weighting algorithms and consider applications of self-assembly of graphs and the boundary components of their thickened graphs to problems involving minimal weight Eulerian walks such as the Chinese Postman Problem and the Windy Postman Problem.
| Identifer | oai:union.ndltd.org:unf.edu/oai:digitalcommons.unf.edu:etd-1887 |
| Date | 01 January 2018 |
| Creators | Bakewell, Katie |
| Publisher | UNF Digital Commons |
| Source Sets | University of North Florida |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | UNF Graduate Theses and Dissertations |
Page generated in 0.0117 seconds