Markov methods for hierarchical coarse-graining of large protein dynamics

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Elastic network models (ENMs), and in particular the Gaussian Network Model (GNM), have been widely used in recent years to gain insights into the machinery of proteins. The extension of ENMs to supramolecular assemblies/complexes presents computational challenges, however, due to the difficulty of retaining atomic details in mode decomposition of large systems dynamics. Here, we present a novel approach to address this problem. Based on a Markovian description of communication/interaction stochastics, we map the full-atom GNM representation into a hierarchy of lower resolution networks, perform the analysis in the reduced space(s) and reconstruct the detailed models dynamics with minimal loss of data. The approach (hGNM) applied to chaperonin GroEL-GroES demonstrates that the shape and frequency dispersion of the dominant 25 modes of motion predicted by a full-residue (8015 nodes) GNM analysis are almost identically reproduced by reducing the complex into a network of 35 soft nodes. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Chennubhotla, C., & Bahar, I. (2006). Markov methods for hierarchical coarse-graining of large protein dynamics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3909 LNBI, pp. 379–393). https://doi.org/10.1007/11732990_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free