اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTheoretical restrictions on longest implicit timescales in Markov state models of biomolecular dynamics
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Markov state models (MSMs) have been widely used to analyze computer simulations of various biomolecular systems. They can capture conformational transitions much slower than an average or maximal length of a single molecular dynamics (MD) trajectory from the set of trajectories used to build the MSM. A rule of thumb claiming that the slowest implicit timescale captured by an MSM should be comparable by the order of magnitude to the aggregate duration of all MD trajectories used to build this MSM has been known in the field. However, this rule have never been formally proved. In this work, we present analytical results for the slowest timescale in several types of MSMs, supporting the above rule. We conclude that the slowest implicit timescale equals the product of the aggregate sampling and four factors that quantify: (1) how much statistics on the conformational transitions corresponding to the longest implicit timescale is available, (2) how good the sampling of the destination Markov state is, (3) the gain in statistics from using a sliding window for counting transitions between Markov states, and (4) a bias in the estimate of the implicit timescale arising from finite sampling of the conformational transitions. We demonstrate that in many practically important cases all these four factors are on the order of unity, and we analyze possible scenarios that could lead to their significant deviation from unity. Overall, we provide for the first time analytical results on the slowest timescales captured by MSMs. These results can guide further practical applications of MSMs to biomolecular dynamics and allow for higher computational efficiency of simulations.
قيم البحث
اقرأ أيضاً
Equilibrium sampling of biomolecules remains an unmet challenge after more than 30 years of atomistic simulation. Efforts to enhance sampling capability, which are reviewed here, range from the development of new algorithms to parallelization to nove
l uses of hardware. Special focus is placed on classifying algorithms -- most of which are underpinned by a few key ideas -- in order to understand their fundamental strengths and limitations. Although algorithms have proliferated, progress resulting from novel hardware use appears to be more clear-cut than from algorithms alone, partly due to the lack of widely used sampling measures.
This chapter reviews the differential geometry-based solvation and electrolyte transport for biomolecular solvation that have been developed over the past decade. A key component of these methods is the differential geometry of surfaces theory, as ap
plied to the solvent-solute boundary. In these approaches, the solvent-solute boundary is determined by a variational principle that determines the major physical observables of interest, for example, biomolecular surface area, enclosed volume, electrostatic potential, ion density, electron density, etc. Recently, differential geometry theory has been used to define the surfaces that separate the microscopic (solute) domains for biomolecules from the macroscopic (solvent) domains. In these approaches, the microscopic domains are modeled with atomistic or quantum mechanical descriptions, while continuum mechanics models (including fluid mechanics, elastic mechanics, and continuum electrostatics) are applied to the macroscopic domains. This multiphysics description is integrated through an energy functional formalism and the resulting Euler-Lagrange equation is employed to derive a variety of governing partial differential equations for different solvation and transport processes; e.g., the Laplace-Beltrami equation for the solvent-solute interface, Poisson or Poisson-Boltzmann equations for electrostatic potentials, the Nernst-Planck equation for ion densities, and the Kohn-Sham equation for solute electron density. Extensive validation of these models has been carried out over hundreds of molecules, including proteins and ion channels, and the experimental data have been compared in terms of solvation energies, voltage-current curves, and density distributions. We also propose a new quantum model for electrolyte transport.
The chaperonin GroEL-GroES, a machine which helps some proteins to fold, cycles through a number of allosteric states, the $T$ state, with high affinity for substrate proteins (SPs), the ATP-bound $R$ state, and the $R^{primeprime}$ ($GroEL-ADP-GroES
$) complex. Structures are known for each of these states. Here, we use a self-organized polymer (SOP) model for the GroEL allosteric states and a general structure-based technique to simulate the dynamics of allosteric transitions in two subunits of GroEL and the heptamer. The $T to R$ transition, in which the apical domains undergo counter-clockwise motion, is mediated by a multiple salt-bridge switch mechanism, in which a series of salt-bridges break and form. The initial event in the $R to R^{primeprime}$ transition, during which GroEL rotates clockwise, involves a spectacular outside-in movement of helices K and L that results in K80-D359 salt-bridge formation. In both the transitions there is considerable heterogeneity in the transition pathways. The transition state ensembles (TSEs) connecting the $T$, $R$, and $R^{primeprime}$ states are broad with the the TSE for the $T to R$ transition being more plastic than the $Rto R^{primeprime}$ TSE. The results suggest that GroEL functions as a force-transmitting device in which forces of about (5-30) pN may act on the SP during the reaction cycle.
We study a phase transition in parameter learning of Hidden Markov Models (HMMs). We do this by generating sequences of observed symbols from given discrete HMMs with uniformly distributed transition probabilities and a noise level encoded in the out
put probabilities. By using the Baum-Welch (BW) algorithm, an Expectation-Maximization algorithm from the field of Machine Learning, we then try to estimate the parameters of each investigated realization of an HMM. We study HMMs with n=4, 8 and 16 states. By changing the amount of accessible learning data and the noise level, we observe a phase-transition-like change in the performance of the learning algorithm. For bigger HMMs and more learning data, the learning behavior improves tremendously below a certain threshold in the noise strength. For a noise level above the threshold, learning is not possible. Furthermore, we use an overlap parameter applied to the results of a maximum-a-posteriori (Viterbi) algorithm to investigate the accuracy of the hidden state estimation around the phase transition.
Knowing a biomolecules structure is inherently linked to and a prerequisite for any detailed understanding of its function. Significant effort has gone into developing technologies for structural characterization. These technologies do not directly p
rovide 3D structures; instead they typically yield noisy and erroneous distance information between specific entities such as atoms or residues, which have to be translated into consistent 3D models. Here we present an approach for this translation process based on maxent-stress optimization. Our new approach extends the original graph drawing method for the new applications specifics by introducing additional constraints and confidence values as well as algorithmic components. Extensive experiments demonstrate that our approach infers structural models (i. e., sensible 3D coordinates for the molecules atoms) that correspond well to the distance information, can handle noisy and error-prone data, and is considerably faster than established tools. Our results promise to allow domain scientists nearly-interactive structural modeling based on distance constraints.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
