Minimal tile and bond-edge types for self-assembling DNA graphs

DOI10.1007/978-3-642-40193-0_11zbMATH Open1290.92024OpenAlexW129334821MaRDI QIDQ4979482FDOQ4979482

Author name not available (Why is that?)

Publication date: 23 June 2014

Published in: Discrete and Topological Models in Molecular Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40193-0_11

Recommendations

• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
• Program size and temperature in self-assembly
• Self-assembling DNA graphs
• Program size and temperature in self-assembly
• An introduction to tile-based self-assembly

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Combinatorial aspects of tessellation and tiling problems (05B45)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
• Spectrum of a Pot for DNA Complexes
• DNA self-assembly: complete tripartite graphs and cocktail party graphs
• On the Complexity of Graph Self-assembly in Accretive Systems
• Design formalism for DNA self-assembly of polyhedral skeletons using rigid tiles
• Tile-based modeling of DNA self-assembly for two graph families with appended paths
• On the complexity of graph self-assembly in accretive systems
• Title not available (Why is that?)

This page was built for publication: Minimal tile and bond-edge types for self-assembling DNA graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979482)