Tile-based modeling of DNA self-assembly for two graph families with appended paths (Q6102107): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4365503000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Tile and Bond-Edge Types for Self-Assembling DNA Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tile-Based DNA Nanostructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectrum of a Pot for DNA Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4965477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 01:56, 1 August 2024

scientific article; zbMATH DE number 7683047
Language Label Description Also known as
English
Tile-based modeling of DNA self-assembly for two graph families with appended paths
scientific article; zbMATH DE number 7683047

    Statements

    Tile-based modeling of DNA self-assembly for two graph families with appended paths (English)
    0 references
    0 references
    0 references
    0 references
    8 May 2023
    0 references
    In 1974, twenty one years after the famous discovery of the structure of the DNA by Watson and Crick, N. Taniguchi, professor of the Tokyo Science University, introduced the term ``nanotechnology'' [\textit{N. Taniguchi}, ``On the basic concept of `nano-technology''', in: Proceedings of the International Conference on Production Engineering. 26--29 (1974)] for describing the engineering of materials at an atomic level. Three years later, at another corner of the Earth, Nadrian (Ned) C. Seeman (1945--2021) was appointed, after earning his PhD in biochemistry at the University of Chicago followed by postdoctoral work first at Columbia University and, then, with the legendary crystallographer A. Rich at the M.I.T. on the structure of large biological molecules. Istvan and Balazs Hargittai dubbed him the pioneer of DNA nanotechnology: [\textit{I. Hargittai} and \textit{B. Hargittai}, Struct. Chem. 33, 631--633 (2022; \url{doi:10.1007/s11224-022-01894-3})]. While not especially successful in various Projects there, Seeman stumbled upon the concept of the so called Holliday junction which caught his imagination. It is worth saying, though, that Seeman's motto was next (1995) ``Just because we can't do it doesn't mean we can't think about doing it''. Recall that Holliday junction was described by the molecular biologist Robin Holliday in 1964. It is a branched nucleic acid structure that joins four double stranded arms. Playing with its model led Seeman to develop his life motif, constructing three-dimensional DNA structures, and he became a nano-architect, inventing DNA nanotechnology in an attempt to better the crystallization process [\textit{E. Winfree} et al., Nature 394, 539--544 (1998; \url{doi:10.1038/28998})]. A key technology of DNA nanotechnology became in the early 2000s DNA-nanostructure self-assembling of some specially designed DNA strands -- the so called target structures. The latter can mathematically be represented as discrete graphs. In this case one can use the Ellis-Monaghan model of a k-armed branched junction molecule that is a molecule of DNA consisting of a center point with extending arms (see Figure 1). Self-assembling of branched molecules of DNA into nanostructures via a complementary cohesive base-pairing is the theme of the present work under review. Its aim is to minimize the number of different types of branched junction molecules necessary to assemble certain target structures. For this purpose this work represents target structures as discrete graphs and branched DNA molecules as vertices with half-edges and presents the minimum numbers of required branched molecule and cohesive-end types under three levels of restrictive conditions for the tadpole and lollipop graph families which represent cycle and complete graphs with a path appended via a single cut-vertex. Three general lemmas regarding these vertex-induced path subgraphs are derived. A summary of the results of three different theoretical lab scenarios is given in Table 3. These results may be helpful in future studies on graphs with path subgraphs appended via a single cut-vertex.
    0 references
    graph theory
    0 references
    discrete graph
    0 references
    lollipop graphs
    0 references
    tadpole graphs
    0 references
    branched molecules
    0 references
    DNA
    0 references
    self-assembly
    0 references
    nanostructures
    0 references
    flexible tile model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references