Simultaneous optimization of assembly time and yield in programmable self-assembly
Maximilian C. Hübl, Carl P. Goodrich
TL;DR
The paper addresses the challenge of predicting and controlling self-assembly kinetics in programmable systems, with a focus on the semiaddressable regime where nondeterministic binding creates off-target kinetic traps. It introduces a framework that treats assembly as a complex reaction network, deriving rate expressions from bond energies and diffusion and then optimizing both the bond energies $E$ and particle concentrations to improve kinetics without sacrificing equilibrium yield. The results show substantial speedups—often by orders of magnitude—across a range of target structures, with the largest gains in nondeterministic, highly interconnected designs and notable improvements in avoiding kinetic traps. The work demonstrates a practical, generalizable method for simultaneous optimization of kinetics and yield in programmable self-assembly, highlighting the value of semiaddressability for faster, cheaper, and more reliable assembly across nanotechnologies and biomolecular systems.
Abstract
Rational design strategies for self-assembly require a detailed understanding of both the equilibrium state and the assembly kinetics. While the former is starting to be well understood, the latter remains a major theoretical challenge, especially in programmable systems and the so-called semiaddressable regime, where binding is often nondeterministic and the formation of off-target structures negatively influences the assembly. Here, we show that it is possible to simultaneously sculpt the assembly outcome and the assembly kinetics through the underexplored design space of binding energies and particle concentrations. By formulating the assembly process as a complex reaction network, we calculate and optimize the tradeoff between assembly speed and quality, and show that parameter optimization can speed up assembly by many orders of magnitude without lowering the yield of the target structure. Although the exact speedup varies from design to design, we find the largest speedups for nondeterministic systems where unoptimized assembly is the slowest, sometimes even making them assemble faster than optimized fully-addressable designs. Therefore, these results not only solve a key challenge in semiaddressable self-assembly, but further emphasize the utility of semiaddressability, where designs have the potential to be faster as well as cheaper (fewer particle species) and better (higher yield). More broadly, our results highlight the importance of parameter optimization in programmable self-assembly, and provide practical tools for simultaneous optimization of kinetics and yield in a wide range of systems.
