Self-Assembling DNA Complexes with a Wheel Graph Structure

2023/02/25 by Gabriel P. López, Lopez, Gabriel, Cory Johnson +1
Biochemistry, Genetics and Molecular Biology · Physics and Astronomy · #05C90 #92E10 #Advanced biosensing and bioanalysis techniques #Combinatorics (math.CO) #DNA and Nucleic Acid Chemistry #FOS: Mathematics #Surface and Thin Film Phenomena

paper · pdf · doi:10.48550/arxiv.2302.13014

openalex publication_date 2023/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Watson-Crick complementary properties of DNA make DNA a useful tool for the self-assembly of various target complexes. Concepts from graph theory can be used to model the self-assembling process in which the vertices of the graph represent k-armed branched junction molecules, called tiles. We seek to determine the minimum number of tile and cohesive-end types necessary to create the desired self-assembled complex. Although results are known for a few infinite classes of graphs, many classes of graphs remain unsolved. We present results for the wheel graph within the restrictions of three different settings.

Related

• Analysis and Algorithmic Construction of Self-Assembled DNA Complexes
• Computational complexity and pragmatic solutions for flexible tile based DNA self-assembly
• Tile Based Modeling of DNA Self-Assembly for Two Graph Families with\n Appended Paths
• Optimal Constructions for DNA Self-Assembly of k-Regular Graphs
• Computation of Minimum Numbers of Tile and Bond-Edge Types for DNA Self-Assembly of Select Archimedean Graphs