算法化罐生成:DNA自组装柔性瓦片模型的算法
Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly
AI总结:
本文针对DNA自组装中如何为给定目标纳米结构选择最优DNA分子集合的问题,基于柔性瓦片图论模型提出了包括整数规划在内的多种算法,以目标无向图为输入并输出最优组件构建块集合。
摘要:
微生物学的最新进展推动了对纳米结构生产的研究,这些结构可应用于生物医学计算和分子机器人等领域。构建这些结构的一种方法是构建分支DNA分子,使其在互补的黏性末端相互结合。一个实际问题是:给定一个目标纳米结构,组装该结构的最优DNA分子集合是什么?我们使用柔性瓦片图论模型开发了多种算法方法,包括一种整数规划方法。这些方法以目标无向图作为输入,并输出用于构建所需结构的最优组件构建块集合。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。