arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.04398math.CO
收藏

自组装DNA复合物的分析与算法构建

Analysis and Algorithmic Construction of Self-Assembled DNA Complexes

Cory Johnson, Andrew Lavengood-Ryan

AI总结:

本研究利用图论分析含单一键边类型的DNA自组装反应池,明确其可构建结构的类型、尺寸及图阶与瓦片臂数的依赖关系,并提出两种构建完整复合物的算法。

摘要:

DNA自组装是一种重要工具,在纳米结构构建、靶向病毒疗法递送及纳米电路等领域有广泛应用。图论工具可用于编码DNA自组装的生物学过程,该过程的核心环节是研究被称为pots(反应池)的分支连接分子集合,并探究可构建的结构类型。我们将研究限定为仅含一组互补粘性末端(即单一键边类型)的反应池,明确了这类反应池可构建的结构类型与尺寸。具体而言,我们证明了反应池输出图的阶数与对应瓦片的臂数之间存在依赖关系。此外,我们提出了两种算法,可为具有单一键边类型的反应池构建完整复合物。

英文摘要:

DNA self-assembly is an important tool that has a wide range of applications such as building nanostructures, the transport of target virotherapies, and nano-circuitry. Tools from graph theory can be used to encode the biological process of DNA self-assembly. The principle component of this process is to examine collections of branched junction molecules, called pots, and study the types of structures that can be constructed. We restrict our attention to pots which contain one set of complementary cohesive-ends, i.e. a single bond-edge type, and we identify the types and sizes of structures that can be built from such a pot. In particular, we show a dependence between the order of graphs in the output of the pot and the number of arms on the corresponding tiles. Furthermore, we provide two algorithms which will construct complete complexes for a pot with a single bond-edge type.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑