DNA Self-assembly: Complete Tripartite Graphs and Cocktail Party Graphs

被引：0

作者：

Almodovar, Leyda ^{[1
]}

Lee, Jane HyoJin ^{[1
]}

Neal, MeiRose ^{[1
]}

Todt, Heiko ^{[1
]}

Williams, Jessica ^{[1
]}

机构：

[1] Stonehill Coll, N Easton, MA 02357 USA

来源：

COMBINATORICS, GRAPH THEORY AND COMPUTING, SEICCGTC 2021 | 2024年 / 448卷

关键词：

DNA self-assembly; Branched junction molecules; Multipartite graphs;

D O I：

10.1007/978-3-031-52969-6_24

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Based on the tile method for DNA self-assembly, which involves branched junction molecules whose flexible k-arms are double strands of DNA, we design a collection of tiles that will construct a nanostructure shaped like a target graph G. We find the minimum number of tile and bond-edge types required to construct complete tripartite graphs and cocktail party graphs in three different scenarios representing distinct levels of laboratory constraints.

引用

页码：269 / 285

页数：17

共 6 条

[1] SYNTHESIS FROM DNA OF A MOLECULE WITH THE CONNECTIVITY OF A CUBE
CHEN, JH
SEEMAN, NC
[J]. NATURE, 1991, 350 (6319) : 631 - 633
[2] Ellis-Monaghan J, 2014, Discrete and topological models in molecular biology, P241
[3] Three dimensional DNA structures in computing
Jonoska, N
Karl, SA
Saito, M
[J]. BIOSYSTEMS, 1999, 52 (1-3) : 143 - 153
[4] Jonoska N, 2006, LECT NOTES COMPUT SC, V4287, P83
[5] Pelesko J.A., 2007, Self-Assembly, V1st ed.
[6] An overview of structural DNA Nanotechnology
Seeman, Nadrian C.
[J]. MOLECULAR BIOTECHNOLOGY, 2007, 37 (03) : 246 - 257

← 1 →