Temperature-Dependent Fold-Switching Mechanism of the Circadian Clock Protein KaiB.

The oscillator of the cyanobacterial circadian clock relies on the ability of the KaiB protein to switch reversibly between a stable ground-state fold (gsKaiB) and an unstable fold-switched fold (fsKaiB). Rare fold-switching events by KaiB provide a critical delay in the negative feedback loop of this post-translational oscillator. In this study, we experimentally and computationally investigate the temperature dependence of fold switching and its mechanism. We demonstrate that the stability of gsKaiB increases with temperature compared to fsKaiB and that the Q10 value for the gsKaiB → fsKaiB transition is nearly three times smaller than that for the reverse transition. Simulations and native-state hydrogen-deuterium exchange NMR experiments suggest that fold switching can involve both subglobally and near-globally unfolded intermediates. The simulations predict that the transition state for fold switching coincides with isomerization of conserved prolines in the most rapidly exchanging region, and we confirm experimentally that proline isomerization is a rate-limiting step for fold switching. We explore the implications of our results for temperature compensation, a hallmark of circadian clocks, through a kinetic model.

Accurate estimates of dynamical statistics using memory.

Many chemical reactions and molecular processes occur on time scales that are significantly longer than those accessible by direct simulations. One successful approach to estimating dynamical statistics for such processes is to use many short time series of observations of the system to construct a Markov state model, which approximates the dynamics of the system as memoryless transitions between a set of discrete states. The dynamical Galerkin approximation (DGA) is a closely related framework for estimating dynamical statistics, such as committors and mean first passage times, by approximating solutions to their equations with a projection onto a basis. Because the projected dynamics are generally not memoryless, the Markov approximation can result in significant systematic errors. Inspired by quasi-Markov state models, which employ the generalized master equation to encode memory resulting from the projection, we reformulate DGA to account for memory and analyze its performance on two systems: a two-dimensional triple well and the AIB9 peptide. We demonstrate that our method is robust to the choice of basis and can decrease the time series length required to obtain accurate kinetics by an order of magnitude.

Dynamics of activation in the voltage-sensing domain of Ciona intestinalis phosphatase Ci-VSP.

The Ciona intestinalis voltage-sensing phosphatase (Ci-VSP) is a membrane protein containing a voltage-sensing domain (VSD) that is homologous to VSDs from voltage-gated ion channels responsible for cellular excitability. Previously published crystal structures of Ci-VSD in putative resting and active conformations suggested a helical-screw voltage sensing mechanism in which the S4 helix translocates and rotates to enable exchange of salt-bridge partners, but the microscopic details of the transition between the resting and active conformations remained unknown. Here, by combining extensive molecular dynamics simulations with a recently developed computational framework based on dynamical operators, we elucidate the microscopic mechanism of the resting-active transition at physiological membrane potential. Sparse regression reveals a small set of coordinates that distinguish intermediates that are hidden from electrophysiological measurements. The intermediates arise from a noncanonical helical-screw mechanism in which translocation, rotation, and side-chain movement of the S4 helix are only loosely coupled. These results provide insights into existing experimental and computational findings on voltage sensing and suggest ways of further probing its mechanism.

Inexact iterative numerical linear algebra for neural network-based spectral estimation and rare-event prediction.

Understanding dynamics in complex systems is challenging because there are many degrees of freedom, and those that are most important for describing events of interest are often not obvious. The leading eigenfunctions of the transition operator are useful for visualization, and they can provide an efficient basis for computing statistics, such as the likelihood and average time of events (predictions). Here, we develop inexact iterative linear algebra methods for computing these eigenfunctions (spectral estimation) and making predictions from a dataset of short trajectories sampled at finite intervals. We demonstrate the methods on a low-dimensional model that facilitates visualization and a high-dimensional model of a biomolecular system. Implications for the prediction problem in reinforcement learning are discussed.