Conserved network motifs allow protein-protein interaction prediction

MOTIVATION: High-throughput protein interaction detection methods are strongly affected by false positive and false negative results. Focused experiments are needed to complement the large-scale methods by validating previously detected interactions but it is often difficult to decide which proteins to probe as interaction partners. Developing reliable computational methods assisting this decision process is a pressing need in bioinformatics. RESULTS: We show that we can use the conserved properties of the protein network to identify and validate interaction candidates. We apply a number of machine learning algorithms to the protein connectivity information and achieve a surprisingly good overall performance in predicting interacting proteins. Using a 'leave-one-out' approach we find average success rates between 20 and 40% for predicting the correct interaction partner of a protein. We demonstrate that the success of these methods is based on the presence of conserved interaction motifs within the network. AVAILABILITY: A reference implementation and a table with candidate interacting partners for each yeast protein are available at http://www.protsuggest.org.     

Social behavior of the yeast protein-protein interaction network

Protein-protein interaction networks are useful in contextual annotation of protein function and in general to achieve a system-level understanding of cellular behavior. This work reports on the social behavior of the yeast protein-protein interaction network and concludes that it is non-random. This work, while providing an analysis of organization of genes into functional societies, can potentially be useful in assessing the accuracy of contextual gene annotation based on such interaction networks.     

Detecting functional modules in the yeast protein-protein interaction network

MOTIVATION: Identification of functional modules in protein interaction networks is a first step in understanding the organization and dynamics of cell functions. To ensure that the identified modules are biologically meaningful, network-partitioning algorithms should take into account not only topological features but also functional relationships, and identified modules should be rigorously validated. RESULTS: In this study we first integrate proteomics and microarray datasets and represent the yeast protein-protein interaction network as a weighted graph. We then extend a betweenness-based partition algorithm, and use it to identify 266 functional modules in the yeast proteome network. For validation we show that the functional modules are indeed densely connected subgraphs. In addition, genes in the same functional module confer a similar phenotype. Furthermore, known protein complexes are largely contained in the functional modules in their entirety. We also analyze an example of a functional module and show that functional modules can be useful for gene annotation. CONTACT: yuan.33@osu.edu SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Identifying protein complexes based on density and modularity in protein-protein interaction network

Background

Identifying protein complexes is crucial to understanding principles of cellular organization and functional mechanisms. As many evidences have indicated that the subgraphs with high density or with high modularity in PPI network usually correspond to protein complexes, protein complexes detection methods based on PPI network focused on subgraph's density or its modularity in PPI network. However, dense subgraphs may have low modularity and subgraph with high modularity may have low density, which results that protein complexes may be subgraphs with low modularity or with low density in the PPI network. As the density-based methods are difficult to mine protein complexes with low density, and the modularity-based methods are difficult to mine protein complexes with low modularity, both two methods have limitation for identifying protein complexes with various density and modularity.

Results

To identify protein complexes with various density and modularity, including those have low density but high modularity and those have low modularity but high density, we define a novel subgraph's fitness, f _ρ , as f _ρ = (density) ^ρ *(modularity)^1-ρ, and propose a novel algorithm, named LF_PIN, to identify protein complexes by expanding seed edges to subgraphs with the local maximum fitness value. Experimental results of LF-PIN in S.cerevisiae show that compared with the results of fitness equal to density (ρ = 1) or equal to modularity (ρ = 0), the LF-PIN identifies known protein complexes more effectively when the fitness value is decided by both density and modularity (0<ρ<1). Compared with the results of seven competing protein complex detection methods (CMC, Core-Attachment, CPM, DPClus, HC-PIN, MCL, and NFC) in S.cerevisiae and E.coli, LF-PIN outperforms other seven methods in terms of matching with known complexes and functional enrichment. Moreover, LF-PIN has better performance in identifying protein complexes with low density or with low modularity.

Conclusions

By considering both the density and the modularity, LF-PIN outperforms other protein complexes detection methods that only consider density or modularity, especially in identifying known protein complexes with low density or low modularity.

     

Molecular basis for evolving modularity in the yeast protein interaction network

Scale-free networks are generically defined by a power-law distribution of node connectivities. Vastly different graph topologies fit this law, ranging from the assortative, with frequent similar-degree node connections, to a modular structure. Using a metric to determine the extent of modularity, we examined the yeast protein network and found it to be significantly self-dissimilar. By orthologous node categorization, we established the evolutionary trend in the network, from an “emerging” assortative network to a present-day modular topology. The evolving topology fits a generic connectivity distribution but with a progressive enrichment in intramodule hubs that avoid each other. Primeval tolerance to random node failure is shown to evolve toward resilience to hub failure, thus removing the fragility often ascribed to scale-free networks. This trend is algorithmically reproduced by adopting a connectivity accretion law that disfavors like-degree connections for large-degree nodes. The selective advantage of this trend relates to the need to prevent a failed hub from inducing failure in an adjacent hub. The molecular basis for the evolutionary trend is likely rooted in the high-entropy penalty entailed in the association of two intramodular hubs.     

Protein bipartivity and essentiality in the yeast protein-protein interaction network

Protein-protein interaction networks (PINs) are structured by means of a few highly connected proteins linked to a large number of less-connected ones. Essential proteins have been found to be more abundant among these highly connected proteins. Here we demonstrate that the likelihood that removal of a protein in a PIN will prove lethal to yeast correlates with the lack of bipartivity of the protein. A protein is bipartite if it can be partitioned in such a way that there are two groups of proteins with intergroup, but not intragroup, interactions. The abundance of essential proteins found among the least bipartite proteins clearly exceeds that found among the most connected ones. For instance, among the top 50 proteins ranked by their lack of bipartivity 62% are essential proteins. However, this percentage is only 38% for proteins ranked according to their number of interactions. Protein bipartivity also surpasses another 5 measures of protein centrality in yeast PIN in identifying essential proteins and doubles the number of essential proteins selected at random. We propose a possible mechanism for the evolution of essential proteins in yeast PIN based on the duplication-divergence scheme. We conclude that a replica protein evolving from a nonbipartite target will also be nonbipartite with high probability. Consequently, these new replicas evolving from nonbipartite (essential) targets will with high probability be essential.     

Functional clustering of yeast proteins from the protein-protein interaction network

Background  

The abundant data available for protein interaction networks have not yet been fully understood. New types of analyses are needed to reveal organizational principles of these networks to investigate the details of functional and regulatory clusters of proteins.     

Topological structure analysis of the protein-protein interaction network in budding yeast

Interaction detection methods have led to the discovery of thousands of interactions between proteins, and discerning relevance within large-scale data sets is important to present-day biology. Here, a spectral method derived from graph theory was introduced to uncover hidden topological structures (i.e. quasi-cliques and quasi-bipartites) of complicated protein-protein interaction networks. Our analyses suggest that these hidden topological structures consist of biologically relevant functional groups. This result motivates a new method to predict the function of uncharacterized proteins based on the classification of known proteins within topological structures. Using this spectral analysis method, 48 quasi-cliques and six quasi-bipartites were isolated from a network involving 11,855 interactions among 2617 proteins in budding yeast, and 76 uncharacterized proteins were assigned functions.     

Promiscuous domains: facilitating stability of the yeast protein-protein interaction network

Domain-domain interactions are a critical type of the mechanisms mediating protein-protein interactions (PPIs). For a given protein domain, its ability to combine with distinct domains is usually referred to as promiscuity or versatility. Interestingly, a previous study has reported that a domain's promiscuity may reflect its ability to interact with other domains in human proteins. In this work, promiscuous domains were first identified from the yeast genome. Then, we sought to determine what roles promiscuous domains might play in the PPI network. Mapping the promiscuous domains onto the proteins in this network revealed that, consistent with the previous knowledge, the hub proteins were significantly enriched with promiscuous domains. We also found that the set of hub proteins were not the same set as those proteins with promiscuous domains, although there was some overlap. Analysis of the topological properties of this yeast PPI network showed that the characteristic path length of the network increased significantly after deleting proteins with promiscuous domains. This indicated that communication between two proteins was longer and the network stability decreased. These observations suggested that, as the hub proteins, proteins with promiscuous domains might play a role in maintaining network stability. In addition, functional analysis revealed that proteins with promiscuous domains mainly participated in the "Folding, Sorting, and Degradation" and "Replication and Repair" biological pathways, and that they significantly execute key molecular functions, such as "nucleoside-triphosphatase activity (GO:0017111)."     

Non-uniform survival rate of heterodimerization links in the evolution of the yeast protein-protein interaction network

Protein-protein interaction networks (PINs) are scale-free networks with a small-world property. In a small-world network, the average cluster coefficient () is much higher than in a random network, but the average shortest path length () is similar between the two networks. To understand the evolutionary mechanisms shaping the structure of PINs, simulation studies using various network growth models have been performed. It has been reported that the heterodimerization (HD) model, in which a new link is added between duplicated nodes with a uniform probability, could reproduce scale-freeness and a high . In this paper, however, we show that the HD model is unsatisfactory, because (i) to reproduce the high in the yeast PIN, a much larger number (n(HI)) of HD links (links between duplicated nodes) are required than the estimated number of n(HI) in the yeast PIN and (ii) the spatial distribution of triangles in the yeast PIN is highly skewed but the HD model cannot reproduce the skewed distribution. To resolve these discrepancies, we here propose a new model named the non-uniform heterodimerization (NHD) model. In this model, an HD link is preferentially attached between duplicated nodes when they share many common neighbors. Simulation studies demonstrated that the NHD model can successfully reproduce the high , the low n(HI), and the skewed distribution of triangles in the yeast PIN. These results suggest that the survival rate of HD links is not uniform in the evolution of PINs, and that an HD link between high-degree nodes tends to be evolutionarily conservative. The non-uniform survival rate of HD links can be explained by assuming a low mutation rate for a high-degree node, and thus this model appears to be biologically plausible.     

Evolvability of yeast protein-protein interaction interfaces

The functional importance of protein-protein interactions indicates that there should be strong evolutionary constraint on their interaction interfaces. However, binding interfaces are frequently affected by amino acid replacements. Change due to coevolution within interfaces can contribute to variability but is not ubiquitous. An alternative explanation for the ability of surfaces to accept replacements may be that many residues can be changed without affecting the interaction. Candidates for these types of residues are those that make interchain interaction only through the protein main chain, β-carbon, or associated hydrogen atoms. Since almost all residues have these atoms, we hypothesize that this subset of interface residues may be more easily substituted than those that make interactions through other atoms. We term such interactions "residue type independent." Investigating this hypothesis, we find that nearly a quarter of residues in protein interaction interfaces make exclusively interchain residue-type-independent contacts. These residues are less structurally constrained and less conserved than residues making residue-type-specific interactions. We propose that residue-type-independent interactions allow substitutions in binding interfaces while the specificity of binding is maintained.     

The interactome as a tree--an attempt to visualize the protein-protein interaction network in yeast

The refinement and high-throughput of protein interaction detection methods offer us a protein–protein interaction network in yeast. The challenge coming along with the network is to find better ways to make it accessible for biological investigation. Visualization would be helpful for extraction of meaningful biological information from the network. However, traditional ways of visualizing the network are unsuitable because of the large number of proteins. Here, we provide a simple but information-rich approach for visualization which integrates topological and biological information. In our method, the topological information such as quasi-cliques or spoke-like modules of the network is extracted into a clustering tree, where biological information spanning from protein functional annotation to expression profile correlations can be annotated onto the representation of it. We have developed a software named PINC based on our approach. Compared with previous clustering methods, our clustering method ADJW performs well both in retaining a meaningful image of the protein interaction network as well as in enriching the image with biological information, therefore is more suitable in visualization of the network.     

A network of protein-protein interactions in yeast

A global analysis of 2,709 published interactions between proteins of the yeast Saccharomyces cerevisiae has been performed, enabling the establishment of a single large network of 2,358 interactions among 1,548 proteins. Proteins of known function and cellular location tend to cluster together, with 63% of the interactions occurring between proteins with a common functional assignment and 76% occurring between proteins found in the same subcellular compartment. Possible functions can be assigned to a protein based on the known functions of its interacting partners. This approach correctly predicts a functional category for 72% of the 1,393 characterized proteins with at least one partner of known function, and has been applied to predict functions for 364 previously uncharacterized proteins.     

Physical and functional modularity of the protein network in yeast

While protein-protein interactions have been studied largely as a network graph without physicality, here we analyze two protein complex data sets of Saccharomyces cerevisiae to relate physical and functional modularity to the network topology. We study for the first time the number of different protein complexes as a function of the protein complex size and find that it follows an exponential decay with a characteristic number of about 7. This reflects the dynamics of complex formation and dissociation in the cell. The analysis of the protein usage by complexes shows an extensive sharing of subunits that is due to the particular organization of the proteome into physical complexes and functional modules. This promiscuity accounts for the high clustering in the protein net-work graph. Our results underscore the need to include the information contained in observed protein complexes into protein network analyses.     

Reconstruction of the yeast protein-protein interaction network involved in nutrient sensing and global metabolic regulation

Background  

Several protein-protein interaction studies have been performed for the yeast Saccharomyces cerevisiae using different high-throughput experimental techniques. All these results are collected in the BioGRID database and the SGD database provide detailed annotation of the different proteins. Despite the value of BioGRID for studying protein-protein interactions, there is a need for manual curation of these interactions in order to remove false positives.     

Using protein-protein interaction network information to predict the subcellular locations of proteins in budding yeast

The information of protein subcellular localization is vitally important for in-depth understanding the intricate pathways that regulate biological processes at the cellular level. With the rapidly increasing number of newly found protein sequence in the Post-Genomic Age, many automated methods have been developed attempting to help annotate their subcellular locations in a timely manner. However, very few of them were developed using the protein-protein interaction (PPI) network information. In this paper, we have introduced a new concept called "tethering potential" by which the PPI information can be effectively fused into the formulation for protein samples. Based on such a network frame, a new predictor called Yeast-PLoc has been developed for identifying budding yeast proteins among their 19 subcellular location sites. Meanwhile, a purely sequence-based approach, called the "hybrid-property" method, is integrated into Yeast-PLoc as a fall-back to deal with those proteins without sufficient PPI information. The overall success rate by the jackknife test on the 4,683 yeast proteins in the training dataset was 70.25%. Furthermore, it was shown that the success rate by Yeast- PLoc on an independent dataset was remarkably higher than those by some other existing predictors, indicating that the current approach by incorporating the PPI information is quite promising. As a user-friendly web-server, Yeast-PLoc is freely accessible at http://yeastloc.biosino.org/.     

Prediction of yeast protein-protein interaction network: insights from the Gene Ontology and annotations

A map of protein–protein interactions provides valuable insight into the cellular function and machinery of a proteome. By measuring the similarity between two Gene Ontology (GO) terms with a relative specificity semantic relation, here, we proposed a new method of reconstructing a yeast protein–protein interaction map that is solely based on the GO annotations. The method was validated using high-quality interaction datasets for its effectiveness. Based on a Z-score analysis, a positive dataset and a negative dataset for protein–protein interactions were derived. Moreover, a gold standard positive (GSP) dataset with the highest level of confidence that covered 78% of the high-quality interaction dataset and a gold standard negative (GSN) dataset with the lowest level of confidence were derived. In addition, we assessed four high-throughput experimental interaction datasets using the positives and the negatives as well as GSPs and GSNs. Our predicted network reconstructed from GSPs consists of 40753 interactions among 2259 proteins, and forms 16 connected components. We mapped all of the MIPS complexes except for homodimers onto the predicted network. As a result, ~35% of complexes were identified interconnected. For seven complexes, we also identified some nonmember proteins that may be functionally related to the complexes concerned. This analysis is expected to provide a new approach for predicting the protein–protein interaction maps from other completely sequenced genomes with high-quality GO-based annotations.     

Structural interpretation of protein-protein interaction network

Background

Currently a huge amount of protein-protein interaction data is available from high throughput experimental methods. In a large network of protein-protein interactions, groups of proteins can be identified as functional clusters having related functions where a single protein can occur in multiple clusters. However experimental methods are error-prone and thus the interactions in a functional cluster may include false positives or there may be unreported interactions. Therefore correctly identifying a functional cluster of proteins requires the knowledge of whether any two proteins in a cluster interact, whether an interaction can exclude other interactions, or how strong the affinity between two interacting proteins is.

Methods

In the present work the yeast protein-protein interaction network is clustered using a spectral clustering method proposed by us in 2006 and the individual clusters are investigated for functional relationships among the member proteins. 3D structural models of the proteins in one cluster have been built – the protein structures are retrieved from the Protein Data Bank or predicted using a comparative modeling approach. A rigid body protein docking method (Cluspro) is used to predict the protein-protein interaction complexes. Binding sites of the docked complexes are characterized by their buried surface areas in the docked complexes, as a measure of the strength of an interaction.

Results

The clustering method yields functionally coherent clusters. Some of the interactions in a cluster exclude other interactions because of shared binding sites. New interactions among the interacting proteins are uncovered, and thus higher order protein complexes in the cluster are proposed. Also the relative stability of each of the protein complexes in the cluster is reported.

Conclusions

Although the methods used are computationally expensive and require human intervention and judgment, they can identify the interactions that could occur together or ones that are mutually exclusive. In addition indirect interactions through another intermediate protein can be identified. These theoretical predictions might be useful for crystallographers to select targets for the X-ray crystallographic determination of protein complexes.

     

Characterization of microRNA-regulated protein-protein interaction network

We have performed topological analysis to elucidate the global correlation between microRNA (miRNA) regulation and protein-protein interaction network in human. The analysis showed that target genes of individual miRNA tend to be hubs and bottlenecks in the network. While proteins directly regulated by miRNA might not form a network module themselves, the miRNA-target genes and their interacting neighbors jointly showed significantly higher modularity. Our findings shed light on how miRNA may regulate the protein interaction network.