共查询到20条相似文献，搜索用时 0 毫秒
1.
Biomolecular interaction network database 总被引：3，自引：0，他引：3
Gilbert D 《Briefings in bioinformatics》2005,6(2):194-198
This software review looks at the utility of the Biomolecular Interaction Network Database (BIND) as a web database. BIND offers methods common to related biology databases and specialisations for its protein interaction data. Searching and browsing this database is easy and well integrated with the underlying data and the needs of scientists. Interaction networks are visualised with software that offers many useful options. The innovative ontoglyphs are used throughout to provide visual cues to protein functions, localisation and other aspects one needs to know for this data set. One can expect to get useful results that may be well integrated with one's research needs. 相似文献
2.
A general principle of biology is the self‐assembly of proteins into functional complexes. Characterizing their composition is, therefore, required for our understanding of cellular functions. Unfortunately, we lack knowledge of the comprehensive set of identities of protein complexes in human cells. To address this gap, we developed a machine learning framework to identify protein complexes in over 15,000 mass spectrometry experiments which resulted in the identification of nearly 7,000 physical assemblies. We show our resource, hu.MAP 2.0, is more accurate and comprehensive than previous state of the art high‐throughput protein complex resources and gives rise to many new hypotheses, including for 274 completely uncharacterized proteins. Further, we identify 253 promiscuous proteins that participate in multiple complexes pointing to possible moonlighting roles. We have made hu.MAP 2.0 easily searchable in a web interface (http://humap2.proteincomplexes.org/), which will be a valuable resource for researchers across a broad range of interests including systems biology, structural biology, and molecular explanations of disease. 相似文献
3.
Although the identification of protein interactions by high-throughput (HTP) methods progresses at a fast pace, 'interactome' data sets still suffer from high rates of false positives and low coverage. To map the human protein interactome, we describe a new framework that uses experimental evidence on structural complexes, the atomic details of binding interfaces and evolutionary conservation. The structurally inferred interaction network is highly modular and more functionally coherent compared with experimental interaction networks derived from multiple literature citations. Moreover, structurally inferred and high-confidence HTP networks complement each other well, allowing us to construct a merged network to generate testable hypotheses and provide valuable experimental leads. 相似文献
4.
From E‐MAPs to module maps: dissecting quantitative genetic interactions using physical interactions
Recent technological breakthroughs allow the quantification of hundreds of thousands of genetic interactions (GIs) in Saccharomyces cerevisiae. The interpretation of these data is often difficult, but it can be improved by the joint analysis of GIs along with complementary data types. Here, we describe a novel methodology that integrates genetic and physical interaction data. We use our method to identify a collection of functional modules related to chromosomal biology and to investigate the relations among them. We show how the resulting map of modules provides clues for the elucidation of function both at the level of individual genes and at the level of functional modules. 相似文献
5.
The biophysical study of protein-protein interactions and docking has important implications in our understanding of most complex cellular signaling processes. Most computational approaches to protein docking involve a tradeoff between the level of detail incorporated into the model and computational power required to properly handle that level of detail. In this work, we seek to optimize that balance by showing that we can reduce the complexity of model representation and thus make the computation tractable with minimal loss of predictive performance. We also introduce a pair-wise statistical potential suitable for docking that builds on previous work and show that this potential can be incorporated into our fast fourier transform-based docking algorithm ZDOCK. We use the Protein Docking Benchmark to illustrate the improved performance of this potential compared with less detailed other scoring functions. Furthermore, we show that the new potential performs well on antibody-antigen complexes, with most predictions clustering around the Complementarity Determining Regions of antibodies without any manual intervention. 相似文献
6.
In identifying subgroups of a heterogeneous disease or condition, it is often desirable to identify both the observations and the features which differ between subgroups. For instance, it may be that there is a subgroup of individuals with a certain disease who differ from the rest of the population based on the expression profile for only a subset of genes. Identifying the subgroup of patients and subset of genes could lead to better-targeted therapy. We can represent the subgroup of individuals and genes as a bicluster, a submatrix,
7.
The ability to analyze and compare protein-protein interactions on the structural level is critical to our understanding of various aspects of molecular recognition and the functional interplay of components of biochemical networks. In this study, we introduce atomic contact vectors (ACVs) as an intuitive way to represent the physico-chemical characteristics of a protein-protein interface as well as a way to compare interfaces to each other. We test the utility of ACVs in classification by using them to distinguish between homodimers and crystal contacts. Our results compare favorably with those reported by other authors. We then apply ACVs to mine the PDB for all known protein-protein complexes and separate transient recognition complexes from permanent oligomeric ones. Getting at the basis of this difference is important for our understanding of recognition and we achieved a success rate of 91% for distinguishing these two classes of complexes. Although accessible surface area of the interface is a major discriminating feature, we also show that there are distinct differences in the contact preferences between the two kinds of complexes. Illustrating the superiority of ACVs as a basic comparison measure over a sequence-based approach, we derive a general rule of thumb to determine whether two protein-protein interfaces are redundant. With this method, we arrive at a nonredundant set of 209 recognition complexes--the largest set reported so far. 相似文献
8.
提出了一种蛋白质相互作用的相似性度量,将其与基因表达数据的相似性度量相结合,定义了一种融合的距离度量,并且将这种融合的距离度量用于改进现有的K—means聚类方法。经过实际数据的检验,改进后的K—means方法比常用的其它几种聚类方法具有更好的效果,说明结合蛋白质相互作用数据可以使得基因表达聚类的结果更有生物意义。 相似文献
9.
Sasson O Kaplan N Linial M 《Protein science : a publication of the Protein Society》2006,15(6):1557-1562
In an era of rapid genome sequencing and high-throughput technology, automatic function prediction for a novel sequence is of utter importance in bioinformatics. While automatic annotation methods based on local alignment searches can be simple and straightforward, they suffer from several drawbacks, including relatively low sensitivity and assignment of incorrect annotations that are not associated with the region of similarity. ProtoNet is a hierarchical organization of the protein sequences in the UniProt database. Although the hierarchy is constructed in an unsupervised automatic manner, it has been shown to be coherent with several biological data sources. We extend the ProtoNet system in order to assign functional annotations automatically. By leveraging on the scaffold of the hierarchical classification, the method is able to overcome some frequent annotation pitfalls. 相似文献
10.
Rebecca Hamer Qiang Luo Judith P. Armitage Gesine Reinert Charlotte M. Deane 《Proteins》2010,78(13):2781-2797
Biological processes are commonly controlled by precise protein‐protein interactions. These connections rely on specific amino acids at the binding interfaces. Here we predict the binding residues of such interprotein complexes. We have developed a suite of methods, i‐Patch, which predict the interprotein contact sites by considering the two proteins as a network, with residues as nodes and contacts as edges. i‐Patch starts with two proteins, A and B, which are assumed to interact, but for which the structure of the complex is not available. However, we assume that for each protein, we have a reference structure and a multiple sequence alignment of homologues. i‐Patch then uses the propensities of patches of residues to interact, to predict interprotein contact sites. i‐Patch outperforms several other tested algorithms for prediction of interprotein contact sites. It gives 59% precision with 20% recall on a blind test set of 31 protein pairs. Combining the i‐Patch scores with an existing correlated mutation algorithm, McBASC, using a logistic model gave little improvement. Results from a case study, on bacterial chemotaxis protein complexes, demonstrate that our predictions can identify contact residues, as well as suggesting unknown interfaces in multiprotein complexes. Proteins 2010. © 2010 Wiley‐Liss, Inc. 相似文献
11.
Govindarajan Sudha Prashant Singh Lakshmipuram S. Swapna Narayanaswamy Srinivasan 《Protein science : a publication of the Protein Society》2015,24(11):1856-1873
Residue types at the interface of protein–protein complexes (PPCs) are known to be reasonably well conserved. However, we show, using a dataset of known 3‐D structures of homologous transient PPCs, that the 3‐D location of interfacial residues and their interaction patterns are only moderately and poorly conserved, respectively. Another surprising observation is that a residue at the interface that is conserved is not necessarily in the interface in the homolog. Such differences in homologous complexes are manifested by substitution of the residues that are spatially proximal to the conserved residue and structural differences at the interfaces as well as differences in spatial orientations of the interacting proteins. Conservation of interface location and the interaction pattern at the core of the interfaces is higher than at the periphery of the interface patch. Extents of variability of various structural features reported here for homologous transient PPCs are higher than the variation in homologous permanent homomers. Our findings suggest that straightforward extrapolation of interfacial nature and inter‐residue interaction patterns from template to target could lead to serious errors in the modeled complex structure. Understanding the evolution of interfaces provides insights to improve comparative modeling of PPC structures. 相似文献
12.
Anna Hadarovich Ivan Anishchenko Alexander V. Tuzikov Petras J. Kundrotas Ilya A. Vakser 《Proteins》2019,87(3):245-253
Structural characterization of protein-protein interactions is essential for our ability to study life processes at the molecular level. Computational modeling of protein complexes (protein docking) is important as the source of their structure and as a way to understand the principles of protein interaction. Rapidly evolving comparative docking approaches utilize target/template similarity metrics, which are often based on the protein structure. Although the structural similarity, generally, yields good performance, other characteristics of the interacting proteins (eg, function, biological process, and localization) may improve the prediction quality, especially in the case of weak target/template structural similarity. For the ranking of a pool of models for each target, we tested scoring functions that quantify similarity of Gene Ontology (GO) terms assigned to target and template proteins in three ontology domains—biological process, molecular function, and cellular component (GO-score). The scoring functions were tested in docking of bound, unbound, and modeled proteins. The results indicate that the combined structural and GO-terms functions improve the scoring, especially in the twilight zone of structural similarity, typical for protein models of limited accuracy. 相似文献
13.
Ivan Anishchenko Petras J. Kundrotas Alexander V. Tuzikov Ilya A. Vakser 《Proteins》2015,83(5):891-897
Structural characterization of protein–protein interactions is essential for our ability to understand life processes. However, only a fraction of known proteins have experimentally determined structures. Such structures provide templates for modeling of a large part of the proteome, where individual proteins can be docked by template‐free or template‐based techniques. Still, the sensitivity of the docking methods to the inherent inaccuracies of protein models, as opposed to the experimentally determined high‐resolution structures, remains largely untested, primarily due to the absence of appropriate benchmark set(s). Structures in such a set should have predefined inaccuracy levels and, at the same time, resemble actual protein models in terms of structural motifs/packing. The set should also be large enough to ensure statistical reliability of the benchmarking results. We present a major update of the previously developed benchmark set of protein models. For each interactor, six models were generated with the model‐to‐native Cα RMSD in the 1 to 6 Å range. The models in the set were generated by a new approach, which corresponds to the actual modeling of new protein structures in the “real case scenario,” as opposed to the previous set, where a significant number of structures were model‐like only. In addition, the larger number of complexes (165 vs. 63 in the previous set) increases the statistical reliability of the benchmarking. We estimated the highest accuracy of the predicted complexes (according to CAPRI criteria), which can be attained using the benchmark structures. The set is available at http://dockground.bioinformatics.ku.edu . Proteins 2015; 83:891–897. © 2015 Wiley Periodicals, Inc. 相似文献
14.
The pathways by which proteins fold into their specific native structure are still an unsolved mystery. Currently, many methods for protein structure prediction are available, and most of them tackle the problem by relying on the vast amounts of data collected from known protein structures. These methods are often not concerned with the route the protein follows to reach its final fold. This work is based on the premise that proteins fold in a hierarchical manner. We present FOBIA, an automated method for predicting a protein structure. FOBIA consists of two main stages: the first finds matches between parts of the target sequence and independently folding structural units using profile-profile comparison. The second assembles these units into a 3D structure by searching and ranking their possible orientations toward each other using a docking-based approach. We have previously reported an application of an initial version of this strategy to homology based targets. Since then we have considerably enhanced our method's abilities to allow it to address the more difficult template-based target category. This allows us to now apply FOBIA to the template-based targets of CASP8 and to show that it is both very efficient and promising. Our method can provide an alternative for template-based structure prediction, and in particular, the docking-basedranking technique presented here can be incorporated into any profile-profile comparison based method. 相似文献
15.
We present version 3.0 of our publicly available protein-protein docking benchmark. This update includes 40 new test cases, representing a 48% increase from Benchmark 2.0. For all of the new cases, the crystal structures of both binding partners are available. As with Benchmark 2.0, Structural Classification of Proteins (Murzin et al., J Mol Biol 1995;247:536-540) was used to remove redundant test cases. The 124 unbound-unbound test cases in Benchmark 3.0 are classified into 88 rigid-body cases, 19 medium-difficulty cases, and 17 difficult cases, based on the degree of conformational change at the interface upon complex formation. In addition to providing the community with more test cases for evaluating docking methods, the expansion of Benchmark 3.0 will facilitate the development of new algorithms that require a large number of training examples. Benchmark 3.0 is available to the public at http://zlab.bu.edu/benchmark. 相似文献
16.
17.
Despite similarities in their sequence and structure, there are a number of homologous proteins that adopt various oligomeric states. Comparisons of these homologous protein pairs, in terms of residue substitutions at the protein–protein interfaces, have provided fundamental characteristics that describe how proteins interact with each other. We have prepared a dataset composed of pairs of related proteins with different homo‐oligomeric states. Using the protein complexes, the interface residues were identified, and using structural alignments, the shadow‐interface residues have been defined as the surface residues that align with the interface residues. Subsequently, we investigated residue substitutions between the interfaces and the shadow interfaces. Based on the degree of the contributions to the interactions, the aligned sites of the interfaces and shadow interfaces were divided into primary and secondary sites; the primary sites are the focus of this work. The primary sites were further classified into two groups (i.e. exposed and buried) based on the degree to which the residue is buried within the shadow interfaces. Using these classifications, two simple mechanisms that mediate the oligomeric states were identified. In the primary‐exposed sites, the residues on the shadow interfaces are replaced by more hydrophobic or aromatic residues, which are physicochemically favored at protein–protein interfaces. In the primary‐buried sites, the residues on the shadow interfaces are replaced by larger residues that protrude into other proteins. These simple rules are satisfied in 23 out of 25 Structural Classification of Proteins (SCOP) families with a different‐oligomeric‐state pair, and thus represent a basic strategy for modulating protein associations and dissociations. Proteins 2010. © 2009 Wiley‐Liss, Inc. 相似文献
18.
Association of a protein complex follows a two-step mechanism, with the first step being the formation of an encounter complex that evolves into the final complex. Here, we analyze recent experimental data of the association of TEM1-beta-lactamase with BLIP using theoretical calculations and simulation. We show that the calculated Debye-Hückel energy of interaction for a pair of proteins during association resembles an energy funnel, with the final complex at the minima. All attraction is lost at inter-protein distances of 20 A, or rotation angles of >60 degrees from the orientation of the final complex. For faster-associating protein complexes, the energy funnel deepens and its volume increases. Mutations with the largest impact on association (hotspots for association) have the largest effect on the size and depth of the energy funnel. Analyzing existing evidence, we suggest that the transition state along the association pathway is the formation of the final complex from the encounter complex. Consequently, pairs of proteins forming an encounter complex will tend to dissociate more readily than to evolve into the final complex. Increasing directional diffusion by increasing favorable electrostatic attraction results in a faster forming and slower dissociating encounter complex. The possible applicability of electrostatic calculations for protein-protein docking is discussed. 相似文献
19.
Victoria Murina Natalia Lekontseva Alexey Nikulin 《Acta Crystallographica. Section D, Structural Biology》2013,69(8):1504-1513
The Hfq protein forms a doughnut‐shaped homohexamer that possesses RNA‐binding activity. There are two distinct RNA‐binding surfaces located on the proximal and the distal sides of the hexamer. The proximal side is involved in the binding of mRNA and small noncoding RNAs (sRNAs), while the distal side has an affinity for A‐rich RNA sequences. In this work, the ability of various ribonucleotides to form complexes with Hfq from Pseudomonas aeruginosa has been tested using X‐ray crystallography. ATP and ADPNP have been located in the distal R‐site, which is a site for poly(A) RNA binding. UTP has been found in the so‐called lateral RNA‐binding site at the proximal surface. CTP has been found in both the distal R‐site and the proximal U‐binding site. GTP did not form a complex with Hfq under the conditions tested. The results have demonstrated the power of the crystallographic method for locating ribonucleotides and predicting single‐stranded RNA‐binding sites on the protein surface. 相似文献
20.
双绕蛋白质的分类与识别 总被引：1，自引：0，他引：1
蛋白质折叠识别是蛋白质结构研究的重要内容。双绕是α/β蛋白质中结构典型的常见折叠类型。选取22个家族中序列一致性小于25%的79个典型双绕蛋白质作为训练集,以RMSD为指标进行系统聚类,并对各类建立基于结构比对的概形隐马尔科夫模型(profile-HMM)。将Astral1.65中序列一致性小于95%的9 505个样本作为检验集,整体识别敏感性为93.9%,特异性为82.1%,MCC值为0.876。结果表明:对于成员较多,无法建立统一模型的折叠类型,分类建模可以实现较高准确率的识别。 相似文献