Bibliographic Details
| Title: |
A multipartite approach for the self-assembly of DNA graph structures. |
| Authors: |
Bonvicini, S.1 (AUTHOR) simona.bonvicini@unimore.it, Ferrari, M. M.2 (AUTHOR) margherita.ferrari@umanitoba.ca |
| Source: |
Natural Computing. Dec2025, Vol. 24 Issue 4, p957-971. 15p. |
| Subjects: |
Graph theory, DNA folding, Platonic solids, Tile design, Combinatorics, Molecules |
| Abstract: |
We consider a graph theory problem motivated by the self-assembly of DNA graph structures using branched junction molecules with flexible arms (called 'tiles' in the combinatorial model). More precisely, we want to determine a set of tiles that realizes a target graph G using the minimum number of bond-edge types so that no graph with order smaller than can be realized; the parameter of interest is denoted by. We present an approach that provides an upper bound for using certain multipartite subgraphs of G. We provide some numerical conditions characterizing such multipartite graphs in terms of the degree of their vertices. Then, we apply our method to the graphs corresponding to the Platonic solids. [ABSTRACT FROM AUTHOR] |
|
Copyright of Natural Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
