College of Arts and Sciences
Master of Science in Mathematical Sciences (MS)
Mathematics & Statistics
NACO controlled Corporate Body
University of North Florida. Department of Mathematics and Statistics
Dr. Daniela Genova
Dr. Michelle DeDeo
Dr. Sami Hamid
Dr. Richard Patterson
Dr. George Rainbolt
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.
Bakewell, Katie, "Self-Assembly of DNA Graphs and Postman Tours" (2018). UNF Graduate Theses and Dissertations. 857.