اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVariational Scheme to Compute Protein Reaction Pathways using Atomistic Force Fields with Explicit Solvent
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a variational approximation to the microscopic dynamics of rare conformational transitions of macromolecules. Within this framework it is possible to simulate on a small computer cluster reactions as complex as protein folding, using state of the art all-atom force fields in explicit solvent. We test this method against molecular dynamics (MD) simulations of the folding of an alpha- and a beta-protein performed with the same all-atom force field on the Anton supercomputer. We find that our approach yields results consistent with those of MD simulations, at a computational cost orders of magnitude smaller.
قيم البحث
اقرأ أيضاً
An Ising--like model of proteins is used to investigate the mechanical unfolding of the Green Fluorescent Protein along different directions. When the protein is pulled from its ends, we recover the major and minor unfolding pathways observed in expe
riments. Upon varying the pulling direction, we find the correct order of magnitude and ranking of the unfolding forces. Exploiting the direction dependence of the unfolding force at equilibrium, we propose a force sensor whose luminescence depends on the applied force.
Deviations from linearity in the dependence of the logarithm of protein unfolding rates, $log k_u(f)$, as a function of mechanical force, $f$, measurable in single molecule experiments, can arise for many reasons. In particular, upward curvature in $
log k_u(f)$ as a function of $f$ implies that the underlying energy landscape must be multidimensional with the possibility that unfolding ensues by parallel pathways. Here, simulations using the SOP-SC model of a wild type $beta$-sandwich protein and several mutants, with immunoglobulin folds, show upward curvature in the unfolding kinetics. There are substantial changes in the structures of the transition state ensembles as force is increased, signaling a switch in the unfolding pathways. Our results, when combined with previous theoretical and experimental studies, show that parallel unfolding of structurally unrelated single domain proteins can be determined from the dependence of $log k_u(f)$ as a function of force (or $log k_u[C]$ where $[C]$ is the denaturant concentration).
There are many proteins or protein complexes which have multiple DNA binding domains. This allows them to bind to multiple points on a DNA molecule (or chromatin fibre) at the same time. There are also many proteins which have been found to be able t
o compact DNA in vitro, and many others have been observed in foci or puncta when fluorescently labelled and imaged in vivo. In this work we study, using coarse-grained Langevin dynamics simulations, the compaction of polymers by simple model proteins and a phenomenon known as the bridging-induced attraction. The latter is a mechanism observed in previous simulations [Brackley et al., Proc. Natl. Acad. Sci. USA 110 (2013)], where proteins modelled as spheres form clusters via their multivalent interactions with a polymer, even in the absence of any explicit protein-protein attractive interactions. Here we extend this concept to consider more detailed model proteins, represented as simple patchy particles interacting with a semi-flexible bead-and-spring polymer. We find that both the compacting ability and the effect of the bridging-induced attraction depend on the valence of the model proteins. These effects also depend on the shape of the protein, which determines its ability to form bridges.
In this PhD thesis, a novel method to determine protein structures using chemical shifts is presented.
Inferring the structural properties of a protein from its amino acid sequence is a challenging yet important problem in biology. Structures are not known for the vast majority of protein sequences, but structure is critical for understanding function
. Existing approaches for detecting structural similarity between proteins from sequence are unable to recognize and exploit structural patterns when sequences have diverged too far, limiting our ability to transfer knowledge between structurally related proteins. We newly approach this problem through the lens of representation learning. We introduce a framework that maps any protein sequence to a sequence of vector embeddings --- one per amino acid position --- that encode structural information. We train bidirectional long short-term memory (LSTM) models on protein sequences with a two-part feedback mechanism that incorporates information from (i) global structural similarity between proteins and (ii) pairwise residue contact maps for individual proteins. To enable learning from structural similarity information, we define a novel similarity measure between arbitrary-length sequences of vector embeddings based on a soft symmetric alignment (SSA) between them. Our method is able to learn useful position-specific embeddings despite lacking direct observations of position-level correspondence between sequences. We show empirically that our multi-task framework outperforms other sequence-based methods and even a top-performing structure-based alignment method when predicting structural similarity, our goal. Finally, we demonstrate that our learned embeddings can be transferred to other protein sequence problems, improving the state-of-the-art in transmembrane domain prediction.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
