基于柔性瓦片的DNA自组装的计算复杂性和实用解决方案
Computational complexity and pragmatic solutions for flexible tile based DNA self-assembly
摘要:
由西曼实验室在20世纪80年代开创的DNA纳米结构的分支连接分子组装已经变得越来越复杂,组装目标也是如此。一个关键的设计步骤是找到最小的分支结分子集,这些分子将自组装成目标结构,而不会形成不需要的子结构。我们使用图论,这是一个自然的设计工具,自组装DNA复合物,来解决这个问题。在确定这种方法的最优设计策略通常是NP完全的,我们提供务实的解决方案的形式,程序的特殊设置和可证明的最优解的自然组装目标,如柏拉图固体,规则晶格,和纳米管。这些例子也说明了设计挑战的范围。
英文摘要:
Branched junction molecule assembly of DNA nanostructures, pioneered by Seeman's laboratory in the 1980s, has become increasingly sophisticated, as have the assembly targets. A critical design step is finding minimal sets of branched junction molecules that will self-assemble into target structures without unwanted substructures forming. We use graph theory, which is a natural design tool for self-assembling DNA complexes, to address this problem. After determining that finding optimal design strategies for this method is generally NP-complete, we provide pragmatic solutions in the form of programs for special settings and provably optimal solutions for natural assembly targets such as platonic solids, regular lattices, and nanotubes. These examples also illustrate the range of design challenges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。