A multipartite approach for the self-assembly of DNA graph structures.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 189909771 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A multipartite approach for the self-assembly of DNA graph structures. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bonvicini%2C+S%2E%22">Bonvicini, S.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> simona.bonvicini@unimore.it</i><br /><searchLink fieldCode="AR" term="%22Ferrari%2C+M%2E+M%2E%22">Ferrari, M. M.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> margherita.ferrari@umanitoba.ca</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Natural+Computing%22">Natural Computing</searchLink>. Dec2025, Vol. 24 Issue 4, p957-971. 15p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22DNA+folding%22">DNA folding</searchLink><br /><searchLink fieldCode="DE" term="%22Platonic+solids%22">Platonic solids</searchLink><br /><searchLink fieldCode="DE" term="%22Tile+design%22">Tile design</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics%22">Combinatorics</searchLink><br /><searchLink fieldCode="DE" term="%22Molecules%22">Molecules</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=189909771 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11047-025-10053-6 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 15 StartPage: 957 Subjects: – SubjectFull: Graph theory Type: general – SubjectFull: DNA folding Type: general – SubjectFull: Platonic solids Type: general – SubjectFull: Tile design Type: general – SubjectFull: Combinatorics Type: general – SubjectFull: Molecules Type: general Titles: – TitleFull: A multipartite approach for the self-assembly of DNA graph structures. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bonvicini, S. – PersonEntity: Name: NameFull: Ferrari, M. M. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 15677818 Numbering: – Type: volume Value: 24 – Type: issue Value: 4 Titles: – TitleFull: Natural Computing Type: main |
| ResultId | 1 |
