Optimal Tilings of Bipartite Graphs Using Self-Assembling DNA
Abstract
Motivated by the recent advancements in nanotechnology and the discovery of new laboratory techniques using the Watson-Crick complementary properties of DNA strands, formal graph theory has recently become useful in the study of self-assembling DNA complexes. Construction methods based on graph theory have resulted in significantly increased efficiency. We present the results of applying graph theoretical and linear algebra techniques for constructing crossed-prism graphs, crown graphs, book graphs, stacked book graphs, and helm graphs, along with kite, cricket, and moth graphs. In particular, we explore various design strategies for these graph families in two sets of laboratory constraints.
Copyright (c) 2023 Eric Redmon, Miles Mena, Megan Vesta, Alvi Renzyl Cortes, Lauren Gernes, Simon Merheb, Nick Soto, Chandler Stimpert, Amanda Harsy

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.