Open Access. Powered by Scholars. Published by Universities.®
Academic -- UNF -- Mathematics; Thickened graphs; Boundary components; Windy Postman Problem; Reporter strands; DNA computing
Articles 1 - 1 of 1
Full-Text Articles in Other Mathematics
Self-Assembly Of Dna Graphs And Postman Tours, Katie Bakewell
Self-Assembly Of Dna Graphs And Postman Tours, Katie Bakewell
UNF Graduate Theses and Dissertations
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 …