Multi-scale coarse-graining for the study of assembly pathways in DNA-brick self-assembly
Journal of Chemical Physics AIP Publishing 148:13 (2018) 134910
Abstract:
Inspired by recent successes using single-stranded DNA tiles to produce complex structures, we develop a two-step coarse-graining approach that uses detailed thermodynamic calculations with oxDNA, a nucleotide-based model of DNA, to parametrize a coarser kinetic model that can reach the time and length scales needed to study the assembly mechanisms of these structures. We test the model by performing a detailed study of the assembly pathways for a two-dimensional target structure made up of 334 unique strands each of which are 42 nucleotides long. Without adjustable parameters, the model reproduces a critical temperature for the formation of the assembly that is close to the temperature at which assembly first occurs in experiments. Furthermore, the model allows us to investigate in detail the nucleation barriers and the distribution of critical nucleus shapes for the assembly of a single target structure. The assembly intermediates are compact and highly connected (although not maximally so), and classical nucleation theory provides a good fit to the height and shape of the nucleation barrier at temperatures close to where assembly first occurs.Input-output maps are strongly biased towards simple outputs
Nature Communications Springer Nature 9 (2018) 761
Abstract:
Many systems in nature can be described using discrete input–output maps. Without knowing details about a map, there may seem to be no a priori reason to expect that a randomly chosen input would be more likely to generate one output over another. Here, by extending fundamental results from algorithmic information theory, we show instead that for many real-world maps, the a priori probability P(x) that randomly sampled inputs generate a particular output x decays exponentially with the approximate Kolmogorov complexity K˜(x) of that output. These input–output maps are biased towards simplicity. We derive an upper bound P(x) ≲ 2−aK˜(x)−b, which is tight for most inputs. The constants a and b, as well as many properties of P(x), can be predicted with minimal knowledge of the map. We explore this strong bias towards simple outputs in systems ranging from the folding of RNA secondary structures to systems of coupled ordinary differential equations to a stochastic financial trading model.How do I obtain reliable knowledge about the world? *
Chapter in A Teacher’s Guide to Science and Religion in the Classroom, Taylor & Francis (2018) 146-151
Introduction to Molecular Simulation
Chapter in QUANTITATIVE BIOLOGY: THEORY, COMPUTATIONAL METHODS, AND MODELS, (2018) 179-205
Rational design of hidden thermodynamic driving through DNA mismatch repair
(2018)