Algorithmic generation of DNA self-assembly graphs

DOI10.46787/PUMP.V8I.4255MaRDI QIDQ6859197zbMATH OpenFDO

Authors Grace Bielefeldt, Iris Horng, Holly Luebsen, Mitchell VonEschen, Leyda Almodóvar Velazquez, Cory Johnson, Jessica Sorrells

Publication date 12 February 2026

Published in PUMP Journal of Undergraduate Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.46787/PUMP.V8I.4255

zbMATH Keywords

algorithmcombinatoricsDNA self-assemblyflexible tile-based modelgraph theoryisomorphism

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Chemical graph theory (05C92) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• scientific article; zbMATH DE number 7675553 (Why is no real title available?)
• Introduction to topological graph theory
• Minimal tile and bond-edge types for self-assembling DNA graphs
• Practical graph isomorphism. II.
• Tile-Based DNA Nanostructures
• Tile-based modeling of DNA self-assembly for two graph families with appended paths

This page was built for publication: Algorithmic generation of DNA self-assembly graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859197)