Full Protein Structure Research Articles

Spectroscopic characterization of europium binding to a calmodulin-EF4 hand peptide-polymer conjugate.

The emergence of biological ligand as an alternative to chemical ligands enables a sustainable lanthanide extraction route. In this study, a peptide originating from the loop of domain 4 calmodulin (EF4) was synthesized and the interaction with europium ions was monitored using time resolved laser fluorescence spectroscopy (TRLFS). Despite being retracted from its full protein structure, the twelve amino acids of calmodulin-EF4 showed binding to europium. Europium-peptide complex formation was evident by an increase in decay time from 110 to 187 μs. The spectra of europium bound to peptide can be easily distinguished from the free europium ion as the 5D0 → 7F2 peak intensifies. When europium bound to the peptide-polymer conjugate, the decay time was further increased to 259 μs. This suggests that lanthanide binding can be enhanced by immobilizing the short peptide into a polymer matrix. The europium-peptide/conjugate bond was reversible, triggered by pH, promoting peptide reusability. Due to the fact that the study was conducted exclusively in water, it suggests minimal use of chemicals is possible while maintaining peptide affinity. This makes the calmodulin-EF4 peptide an ideal candidate as biological ligand. This study lays the groundwork for developing a peptide-based filter material for lanthanide separation.

How to choose templates for modeling of protein complexes: Insights from benchmarking template-based docking.

Comparative docking is based on experimentally determined structures of protein-protein complexes (templates), following the paradigm that proteins with similar sequences and/or structures form similar complexes. Modeling utilizing structure similarity of target monomers to template complexes significantly expands structural coverage of the interactome. Template-based docking by structure alignment can be performed for the entire structures or by aligning targets to the bound interfaces of the experimentally determined complexes. Systematic benchmarking of docking protocols based on full and interface structure alignment showed that both protocols perform similarly, with top 1 docking success rate 26%. However, in terms of the models' quality, the interface-based docking performed marginally better. The interface-based docking is preferable when one would suspect a significant conformational change in the full protein structure upon binding, for example, a rearrangement of the domains in multidomain proteins. Importantly, if the same structure is selected as the top template by both full and interface alignment, the docking success rate increases 2-fold for both top 1 and top 10 predictions. Matching structural annotations of the target and template proteins for template detection, as a computationally less expensive alternative to structural alignment, did not improve the docking performance. Sophisticated remote sequence homology detection added templates to the pool of those identified by structure-based alignment, suggesting that for practical docking, the combination of the structure alignment protocols and the remote sequence homology detection may be useful in order to avoid potential flaws in generation of the structural templates library.

Modular decomposition of protein structure using community detection

As the number of solved protein structures increases, the opportunities for meta-analysis of this dataset increase too. Protein structures are known to be formed of domains; structural and functional subunits that are often repeated across sets of proteins. These domains generally form compact, globular regions, and are therefore often easily identifiable by inspection, yet the problem of automatically fragmenting the protein into these compact substructures remains computationally challenging. Existing domain classification methods focus on finding subregions of protein structure that are conserved, rather than finding a decomposition which spans the full protein structure. However, such a decomposition would find ready application in coarse-graining molecular dynamics, analysing the protein’s topology, in de novo protein design and in fitting electron microscopy maps. Here, we present a tool for performing this modular decomposition using the Infomap community detection algorithm. The protein structure is abstracted into a network in which its amino acids are the nodes, and where the edges are generated using a simple proximity test. Infomap can then be used to identify highly intra-connected regions of the protein. We perform this decomposition systematically across 4000 distinct protein structures, taken from the Protein Data Bank. The decomposition obtained correlates well with existing PFAM sequence classifications, but has the advantage of spanning the full protein, with the potential for novel domains. The coarse-grained network formed by the communities can also be used as a proxy for protein topology at the single-chain level; we demonstrate that grouping these proteins by their coarse-grained network results in a functionally significant classification.

Integrating NOE and RDC using sum-of-squares relaxation for protein structure determination.

We revisit the problem of protein structure determination from geometrical restraints from NMR, using convex optimization. It is well-known that the NP-hard distance geometry problem of determining atomic positions from pairwise distance restraints can be relaxed into a convex semidefinite program (SDP). However, often the NOE distance restraints are too imprecise and sparse for accurate structure determination. Residual dipolar coupling (RDC) measurements provide additional geometric information on the angles between atom-pair directions and axes of the principal-axis-frame. The optimization problem involving RDC is highly non-convex and requires a good initialization even within the simulated annealing framework. In this paper, we model the protein backbone as an articulated structure composed of rigid units. Determining the rotation of each rigid unit gives the full protein structure. We propose solving the non-convex optimization problems using the sum-of-squares (SOS) hierarchy, a hierarchy of convex relaxations with increasing complexity and approximation power. Unlike classical global optimization approaches, SOS optimization returns a certificate of optimality if the global optimum is found. Based on the SOS method, we proposed two algorithms-RDC-SOS and RDC-NOE-SOS, that have polynomial time complexity in the number of amino-acid residues and run efficiently on a standard desktop. In many instances, the proposed methods exactly recover the solution to the original non-convex optimization problem. To the best of our knowledge this is the first time SOS relaxation is introduced to solve non-convex optimization problems in structural biology. We further introduce a statistical tool, the Cramér-Rao bound (CRB), to provide an information theoretic bound on the highest resolution one can hope to achieve when determining protein structure from noisy measurements using any unbiased estimator. Our simulation results show that when the RDC measurements are corrupted by Gaussian noise of realistic variance, both SOS based algorithms attain the CRB. We successfully apply our method in a divide-and-conquer fashion to determine the structure of ubiquitin from experimental NOE and RDC measurements obtained in two alignment media, achieving more accurate and faster reconstructions compared to the current state of the art.

Structural Alphabets for Protein Structure Classification: A Comparison Study

Finding structural similarities between proteins often helps reveal shared functionality, which otherwise might not be detected by native sequence information alone. Such similarity is usually detected and quantified by protein structure alignment. Determining the optimal alignment between two protein structures, however, remains a hard problem. An alternative approach is to approximate each three-dimensional protein structure using a sequence of motifs derived from a structural alphabet. Using this approach, structure comparison is performed by comparing the corresponding motif sequences or structural sequences. In this article, we measure the performance of such alphabets in the context of the protein structure classification problem. We consider both local and global structural sequences. Each letter of a local structural sequence corresponds to the best matching fragment to the corresponding local segment of the protein structure. The global structural sequence is designed to generate the best possible complete chain that matches the full protein structure. We use an alphabet of 20 letters, corresponding to a library of 20 motifs or protein fragments having four residues. We show that the global structural sequences approximate well the native structures of proteins, with an average coordinate root mean square of 0.69 Å over 2225 test proteins. The approximation is best for all α-proteins, while relatively poorer for all β-proteins. We then test the performance of four different sequence representations of proteins (their native sequence, the sequence of their secondary-structure elements, and the local and global structural sequences based on our fragment library) with different classifiers in their ability to classify proteins that belong to five distinct folds of CATH. Without surprise, the primary sequence alone performs poorly as a structure classifier. We show that addition of either secondary-structure information or local information from the structural sequence considerably improves the classification accuracy. The two fragment-based sequences perform better than the secondary-structure sequence but not well enough at this stage to be a viable alternative to more computationally intensive methods based on protein structure alignment.

Unfolding and Refolding of Juvenile Hormone Binding Protein

Juvenile hormone (JH) regulates insect development. JH present in the hemolymph is bound to a specific glycoprotein, juvenile hormone binding protein (JHBP), which serves as a carrier to deploy the hormone to target tissues. In this report structural changes of JHBP from Galleria mellonella induced by guanidine hydrochloride have been investigated by a combination of size-exclusion chromatography, protein activity measurements, and spectroscopic methods. Molecules of JHBP change their conformation from a native state via two unstable intermediates to a denatured state. The first intermediate appears in a compact state, because it slightly changes its molecular size and preserves most of the JHBP secondary structure of the native state. Although the second intermediate also preserves a substantial part of the secondary structure, it undergoes a change into a noncompact state changing its Stokes radius from ∼30 to 39 Å. Refolding experiments showed that JHBP molecules recover their full protein structure, as judged from the CD spectrum, fluorescence experiments, and JH binding activity measurements. The free energy of unfolding in the absence of the denaturant, Δ G D–N, is calculated to be 4.1 kcal mol −1.

Protein folding simulations with genetic algorithms and a detailed molecular description

We have explored the application of genetic algorithms (GA) to the determination of protein structure from sequence, using a full atom representation. A free energy function with point charge electrostatics and an area based solvation model is used. The method is found to be superior to previously investigated Monte Carlo algorithms. For selected fragments, up to 14 residues long, the lowest free energy structures produced by the GA are similar in conformation to the corresponding experimental structures in most cases. There are three main conclusions from these results. First, the genetic algorithm is an effective method for searching amongst the compact conformations of a polypeptide chain. Second, the free energy function is generally able to select native-like conformations. However, some deficiencies are identified, and further development is proposed. Third, the selection of native-like conformations for some protein fragments establishes that in these cases the conformation observed in the full protein structure is largely context independent. The implications for the nature of protein folding pathways are discussed.

Polarization analysis of N-acetyl- N′-methyl aspartyl amide ion and similar systems

In order to construct the protein structure of such molecules as papaine and subtilisine it is necessary to do a set of prior studies such as those of possible polarization changes of significant fractions by which the whole molecular structure may be considered as being integrated. We report here the case of the N-acetyl- N′-methyl-aspartyl amide ion (CH 3CONHCH(ASP −)CONHCH 3) as representative among the studied systems. The trends were the same in all cases, enabling us to assume that it is feasible to make use of standard molecular fractions to construct the full protein structure.