Pattern recognition in the nucleation kinetics of non-equilibrium self-assembly

  title={Pattern recognition in the nucleation kinetics of non-equilibrium self-assembly},
  author={Constantine G. Evans and Jackson O'Brien and Erik Winfree and Arvind Murugan},
Inspired by biology’s most sophisticated computer, the brain, neural networks constitute a profound refor-mulation of computational principles. Remarkably, analogous high-dimensional, highly-interconnected computational architectures also arise within information-processing molecular systems inside living cells, such as signal transduction cascades and genetic regulatory networks. Might neuromorphic collective modes be found more broadly in other physical and chemical processes, even those that… 

Figures from this paper



Associative Pattern Recognition Through Macro-molecular Self-Assembly

It is shown that macro-molecular self- assembly can recognize and classify high-dimensional patterns in the concentrations of N distinct molecular species, and it is found that self-assembly bears greater similarity to continuous attractor neural networks, such as place cell networks that store spatial memories, rather than discrete memory networks.

Diverse and robust molecular algorithms using reprogrammable DNA self-assembly

A set of 355 self-assembling DNA ‘tiles’ can be reprogrammed to implement many different computer algorithms—including sorting, palindrome testing and divisibility by three—suggesting that molecular self-assembly could be a reliable algorithmic component in programmable chemical systems.

Neural network computation with DNA strand displacement cascades

It is suggested that DNA strand displacement cascades could be used to endow autonomous chemical systems with the capability of recognizing patterns of molecular events, making decisions and responding to the environment.

Algorithmic Self-Assembly of DNA Sierpinski Triangles

This work reports the molecular realization, using two-dimensional self-assembly of DNA tiles, of a cellular automaton whose update rule computes the binary function XOR and thus fabricates a fractal pattern—a Sierpinski triangle—as it grows.

Direct observation and rational design of nucleation behavior in addressable self-assembly

The experiments show that modifying the critical nucleus required to initiate structure growth can broaden the range of conditions over which self-assembly occurs and, consequently, can dramatically improve the final yield of correctly formed structures.

Programmable Control of Nucleation for Algorithmic Self-Assembly

This work demonstrates that growth of objects via algorithmic self-assembly can proceed both efficiently and with an arbitrarily low error rate, even in a model where local growth rules are probabilistic.

Undesired usage and the robust self-assembly of heterogeneous structures.

The results support a general principle of 'undesired usage'-concentrations of components should be chosen to account for how they are 'used' by undesired structures and not just by the desired structure.

A synthetic protein-level neural network in mammalian cells

This work combines de novo designed protein heterodimers and engineered viral proteases to implement a synthetic protein circuit that performs winner-take-all neural network computation in mammalian cells.

On schemes of combinatorial transcription logic

This work shows explicit schemes to implement regulatory logic functions of increasing complexity by appropriately selecting the strengths and arranging the relative positions of the relevant protein-binding DNA sequences in the cis-regulatory region.

Rational design of self-assembly pathways for complex multicomponent structures

A new theory of “addressable” self-assembly is explained, which predicts that correct assembly of the complete structure may require a time-dependent experimental protocol, and it is predicted that low coordination numbers result in nonclassical nucleation behavior, which is essential for achieving optimal nucleation kinetics under mild growth conditions.