Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916342132637696 |
|---|---|
| author | Ashworth, Jacob Grossmann, Luca Navarro, Fausto Almodovar, Leyda Harsy, Amanda Johnson, Cory Sorrells, Jessica |
| author_facet | Ashworth, Jacob Grossmann, Luca Navarro, Fausto Almodovar, Leyda Harsy, Amanda Johnson, Cory Sorrells, Jessica |
| contents | Recent advancements in microbiology have motivated the study of the production of nanostructures with applications such as biomedical computing and molecular robotics. One way to construct these structures is to construct branched DNA molecules that bond to each other at complementary cohesive ends. One practical question is: given a target nanostructure, what is the optimal set of DNA molecules that assemble such a structure? We use a flexible-tile graph theoretic model to develop several algorithmic approaches, including a integer programming approach. These approaches take a target undirected graph as an input and output an optimal collection of component building blocks to construct the desired structure. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_00192 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly Ashworth, Jacob Grossmann, Luca Navarro, Fausto Almodovar, Leyda Harsy, Amanda Johnson, Cory Sorrells, Jessica Combinatorics 92E10 05C90 05C85 92D20 Recent advancements in microbiology have motivated the study of the production of nanostructures with applications such as biomedical computing and molecular robotics. One way to construct these structures is to construct branched DNA molecules that bond to each other at complementary cohesive ends. One practical question is: given a target nanostructure, what is the optimal set of DNA molecules that assemble such a structure? We use a flexible-tile graph theoretic model to develop several algorithmic approaches, including a integer programming approach. These approaches take a target undirected graph as an input and output an optimal collection of component building blocks to construct the desired structure. |
| title | Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly |
| topic | Combinatorics 92E10 05C90 05C85 92D20 |
| url | https://arxiv.org/abs/2408.00192 |