Spectrum of a Pot for DNA Complexes

DOI10.1007/11925903_7zbMATH Open1132.68399OpenAlexW1539097373MaRDI QIDQ5452563FDOQ5452563

Authors: Gregory Loren McColm, A. Staninska, Nataşa Jonoska 

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11925903_7

Recommendations

• On stoichiometry for the assembly of flexible tile DNA complexes
• Self-assembling DNA graphs
• Minimal tile and bond-edge types for self-assembling DNA graphs
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Complexity classes for self-assembling flexible tiles

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (6)

• A comparison of graph-theoretic DNA hybridization models
• Complexity classes for self-assembling flexible tiles
• DNA self-assembly: complete tripartite graphs and cocktail party graphs
• 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
• Study of transient luminescence of three kinds of Ru complexes bound to DNA

This page was built for publication: Spectrum of a Pot for DNA Complexes

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