38,538 research outputs found
Pressure-dependent 13C chemical shifts in proteins: Origins and applications
Pressure-dependent (13)C chemical shifts have been measured for aliphatic carbons in barnase and Protein G. Up to 200 MPa (2 kbar), most shift changes are linear, demonstrating pressure-independent compressibilities. CH(3), CH(2) and CH carbon shifts change on average by +0.23, -0.09 and -0.18 ppm, respectively, due to a combination of bond shortening and changes in bond angles, the latter matching one explanation for the gamma-gauche effect. In addition, there is a residue-specific component, arising from both local compression and conformational change. To assess the relative magnitudes of these effects, residue-specific shift changes for protein G were converted into structural restraints and used to calculate the change in structure with pressure, using a genetic algorithm to convert shift changes into dihedral angle restraints. The results demonstrate that residual (13)C alpha shifts are dominated by dihedral angle changes and can be used to calculate structural change, whereas (13)C beta shifts retain significant dependence on local compression, making them less useful as structural restraints
GAPDOCK: A genetic algorithm approach to protein docking in CAPRI round 1
As part of the first Critical Assessment of PRotein Interactions, round 1, we predict the structure of two protein-protein complexes, by using a genetic algorithm, GAPDOCK, in combination with surface complementarity, buried surface area, biochemical information, and human intervention. Among the five models submitted for target 1, HPr phosphocarrier protein (B. subtilis) and the hexameric HPr kinase (L. lactis), the best correctly predicts 17 of 52 interprotein contacts, whereas for target 2, bovine rotavirus VP6 protein-monoclonal antibody, the best model predicts 27 of 52 correct contacts. Given the difficult nature of the targets, these predictions are very encouraging and compare well with those obtained by other methods. Nevertheless, it is clear that there is a need for improved methods for distinguishing between correct and plausible but incorrect complexes. Proteins 2003;52:10-14
How round is a protein? Exploring protein structures for globularity using conformal mapping.
We present a new algorithm that automatically computes a measure of the geometric difference between the surface of a protein and a round sphere. The algorithm takes as input two triangulated genus zero surfaces representing the protein and the round sphere, respectively, and constructs a discrete conformal map f between these surfaces. The conformal map is chosen to minimize a symmetric elastic energy E S (f) that measures the distance of f from an isometry. We illustrate our approach on a set of basic sample problems and then on a dataset of diverse protein structures. We show first that E S (f) is able to quantify the roundness of the Platonic solids and that for these surfaces it replicates well traditional measures of roundness such as the sphericity. We then demonstrate that the symmetric elastic energy E S (f) captures both global and local differences between two surfaces, showing that our method identifies the presence of protruding regions in protein structures and quantifies how these regions make the shape of a protein deviate from globularity. Based on these results, we show that E S (f) serves as a probe of the limits of the application of conformal mapping to parametrize protein shapes. We identify limitations of the method and discuss its extension to achieving automatic registration of protein structures based on their surface geometry
Structural Prediction of Protein–Protein Interactions by Docking: Application to Biomedical Problems
A huge amount of genetic information is available thanks to the recent advances in sequencing technologies and the larger computational capabilities, but the interpretation of such genetic data at phenotypic level remains elusive. One of the reasons is that proteins are not acting alone, but are specifically interacting with other proteins and biomolecules, forming intricate interaction networks that are essential for the majority of cell processes and pathological conditions. Thus, characterizing such interaction networks is an important step in understanding how information flows from gene to phenotype. Indeed, structural characterization of protein–protein interactions at atomic resolution has many applications in biomedicine, from diagnosis and vaccine design, to drug discovery. However, despite the advances of experimental structural determination, the number of interactions for which there is available structural data is still very small. In this context, a complementary approach is computational modeling of protein interactions by docking, which is usually composed of two major phases: (i) sampling of the possible binding modes between the interacting molecules and (ii) scoring for the identification of the correct orientations. In addition, prediction of interface and hot-spot residues is very useful in order to guide and interpret mutagenesis experiments, as well as to understand functional and mechanistic aspects of the interaction. Computational docking is already being applied to specific biomedical problems within the context of personalized medicine, for instance, helping to interpret pathological mutations involved in protein–protein interactions, or providing modeled structural data for drug discovery targeting protein–protein interactions.Spanish Ministry of Economy grant number BIO2016-79960-R; D.B.B. is supported by a
predoctoral fellowship from CONACyT; M.R. is supported by an FPI fellowship from the
Severo Ochoa program. We are grateful to the Joint BSC-CRG-IRB Programme in
Computational Biology.Peer ReviewedPostprint (author's final draft
Variable-free exploration of stochastic models: a gene regulatory network example
Finding coarse-grained, low-dimensional descriptions is an important task in
the analysis of complex, stochastic models of gene regulatory networks. This
task involves (a) identifying observables that best describe the state of these
complex systems and (b) characterizing the dynamics of the observables. In a
previous paper [13], we assumed that good observables were known a priori, and
presented an equation-free approach to approximate coarse-grained quantities
(i.e, effective drift and diffusion coefficients) that characterize the
long-time behavior of the observables. Here we use diffusion maps [9] to
extract appropriate observables ("reduction coordinates") in an automated
fashion; these involve the leading eigenvectors of a weighted Laplacian on a
graph constructed from network simulation data. We present lifting and
restriction procedures for translating between physical variables and these
data-based observables. These procedures allow us to perform equation-free
coarse-grained, computations characterizing the long-term dynamics through the
design and processing of short bursts of stochastic simulation initialized at
appropriate values of the data-based observables.Comment: 26 pages, 9 figure
- …