The dissociation rate (k off) associated with ligand unbinding events from proteins is a parameter of fundamental importance in drug design. Here we review recent major advancements in molecular simulation methodologies for the prediction of k off. Next, we discuss the impact of the potential energy function models on the accuracy of calculated k off values. Finally, we provide a perspective from high-performance computing and machine learning which might help improve such predictions.

/pdf/enhanced-sampling-simulations-for-the-estimation-of-ligand-3053q0qm.pdf

Enhanced-Sampling Simulations for the Estimation of Ligand Binding Kinetics: Current Status and Perspective

Self-assembled metallo-organic cages have emerged as promising biomimetic platforms that can encapsulate whole substrates akin to an enzyme active site. Extensive experimental work has enabled access to a variety of structures, with a few notable examples showing catalytic behavior. However, computational investigations of metallo-organic cages are scarce, not least due to the challenges associated with their modeling and the lack of accurate and efficient protocols to evaluate these systems. In this review, we discuss key molecular principles governing the design of functional metallo-organic cages, from the assembly of building blocks through binding and catalysis. For each of these processes, computational protocols will be reviewed, considering their inherent strengths and weaknesses. We will demonstrate that while each approach may have its own specific pitfalls, they can be a powerful tool for rationalizing experimental observables and to guide synthetic efforts. To illustrate this point, we present several examples where modeling has helped to elucidate fundamental principles behind molecular recognition and reactivity. We highlight the importance of combining computational and experimental efforts to speed up supramolecular catalyst design while reducing time and resources.

https://pubs.acs.org/doi/pdf/10.1021/acscatal.2c00837

Computational Modeling of Supramolecular Metallo-organic Cages–Challenges and Opportunities

Coarse-grained (CG) molecular simulations have become a standard tool to study molecular processes on time and length scales inaccessible to all-atom simulations. Parametrizing CG force fields to match all-atom simulations has mainly relied on force-matching or relative entropy minimization, which require many samples from costly simulations with all-atom or CG resolutions, respectively. Here we present flow-matching, a new training method for CG force fields that combines the advantages of both methods by leveraging normalizing flows, a generative deep learning method. Flow-matching first trains a normalizing flow to represent the CG probability density, which is equivalent to minimizing the relative entropy without requiring iterative CG simulations. Subsequently, the flow generates samples and forces according to the learned distribution in order to train the desired CG free energy model via force-matching. Even without requiring forces from the all-atom simulations, flow-matching outperforms classical force-matching by an order of magnitude in terms of data efficiency and produces CG models that can capture the folding and unfolding transitions of small proteins.

/pdf/flow-matching-efficient-coarse-graining-of-molecular-rlnnunkr.pdf

Flow-Matching: Efficient Coarse-Graining of Molecular Dynamics without Forces.

Finding a low dimensional representation of data from long-timescale trajectories of biomolecular processes, such as protein folding or ligand-receptor binding, is of fundamental importance, and kinetic models, such as Markov modeling, have proven useful in describing the kinetics of these systems. Recently, an unsupervised machine learning technique called VAMPNet was introduced to learn the low dimensional representation and the linear dynamical model in an end-to-end manner. VAMPNet is based on the variational approach for Markov processes and relies on neural networks to learn the coarse-grained dynamics. In this paper, we combine VAMPNet and graph neural networks to generate an end-to-end framework to efficiently learn high-level dynamics and metastable states from the long-timescale molecular dynamics trajectories. This method bears the advantages of graph representation learning and uses graph message passing operations to generate an embedding for each datapoint, which is used in the VAMPNet to generate a coarse-grained dynamical model. This type of molecular representation results in a higher resolution and a more interpretable Markov model than the standard VAMPNet, enabling a more detailed kinetic study of the biomolecular processes. Our GraphVAMPNet approach is also enhanced with an attention mechanism to find the important residues for classification into different metastable states.

GraphVAMPNet, using graph neural networks and variational approach to markov processes for dynamical modeling of biomolecules

Coarse-grained (CG) molecular simulations have become a standard tool to study molecular processes on timeand length-scales inaccessible to all-atom simulations. Learning CG force fields from all-atom data has mainly relied on force-matching and relative entropy minimization. Force-matching is straightforward to implement but requires the forces on the CG particles to be saved during all-atom simulation, and because these instantaneous forces depend on all degrees of freedom, they provide a very noisy signal that makes training the CG force field data inefficient. Relative entropy minimization does not require forces to be saved and is more data-efficient, but requires the CG model to be re-simulated during the iterative training procedure, which can make the training procedure extremely costly or lead to failure to converge. Here we present flow-matching, a new training method for CG force fields that combines the advantages of force-matching and relative entropy minimization by leveraging normalizing flows, a generative deep learning method. Flow-matching first trains a normalizing flow to represent the CG probability density by using relative entropy minimization without suffering from the re-simulation problem because flows can directly sample from the equilibrium distribution they represent. Subsequently, the forces of the flow are used to train a CG force field by matching the coarse-grained forces directly, which is a much easier problem than traditional force-matching as it does not suffer from the noise problem. Besides not requiring forces, flow-matching also outperforms classical forcematching by an order of magnitude in terms of data efficiency and produces CG models that can capture the folding and unfolding of small proteins.

Force-matching Coarse-Graining without Forces

Anton 3 is the newest member in a family of supercomputers specially designed for atomic-level simulation of molecules relevant to biology (e.g., DNA, proteins, and drug molecules). Anton 3 achieves order-of-magnitude improvements in time-to-solution over its predecessor, Anton 2 (the current state of the art), and is over 100-fold faster than any other currently available supercomputer, thereby enabling broad new avenues of research on critical questions in biology and drug discovery. This speedup means that a 512-node Anton 3 simulates a million atoms at over 100 microseconds per day. Furthermore, Anton 3 attains this performance while consuming an order of magnitude less energy per simulated microsecond than any other machine. Like its predecessors, Anton 3 was designed from the ground up around a new custom chip to best exploit the capabilities offered by new technologies. We present here the main architectural and algorithmic developments that were necessary to achieve such significant advances.

Anton 3: twenty microseconds of molecular dynamics simulation before lunch

• Understand biomolecular systems through their motions •Numerical integration of Newton's laws of motion — Model atoms as point masses — Compute forces on every atom based on current positions — Update atom velocities and positions in discrete time steps of a few femtoseconds • Force computation described by a model: the force field

Adam McLaughlin

Papers

Anton 3: twenty microseconds of molecular dynamics simulation before lunch

The ΛNTON 3 ASIC: a Fire-Breathing Monster for Molecular Dynamics Simulations