Back to search

University of North Florida. Department of Mathematics and Statistics

Self-Assembly of DNA Graphs and Postman Tours

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mathematical Sciences (MS)
Discipline thesis:degree_discipline
Mathematics & Statistics
Grantor
University of North Florida. Department of Mathematics and Statistics
Date dc:date.issued
Spring

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Bakewell, Katie
  • Bakewell, Katie, 1986-
Advisors dc:contributor.advisor
  • Genova, Daniela
  • DeDeo, Michelle
  • Hamid, Sami
Contributors dc:contributor
  • Dr. Daniela Genova
  • Dr. Michelle DeDeo
  • Dr. Sami Hamid

Subjects

dc:subject × 7

Rights

dc:rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.unf.edu/etd/857

Chain of custody

source
Harvested from
University of North Florida
Base URL
digitalcommons.unf.edu/do/oai/
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Bakewell, Katie; Bakewell, Katie, 1986-. Self-Assembly of DNA Graphs and Postman Tours. University of North Florida. Department of Mathematics and Statistics, https://digitalcommons.unf.edu/etd/857