Discovering protein complexes in protein interaction networks via exploring the weak ties effect

Background

Studying protein complexes is very important in biological processes since it helps reveal the structure-functionality relationships in biological networks and much attention has been paid to accurately predict protein complexes from the increasing amount of protein-protein interaction (PPI) data. Most of the available algorithms are based on the assumption that dense subgraphs correspond to complexes, failing to take into account the inherence organization within protein complex and the roles of edges. Thus, there is a critical need to investigate the possibility of discovering protein complexes using the topological information hidden in edges.

Results

To provide an investigation of the roles of edges in PPI networks, we show that the edges connecting less similar vertices in topology are more significant in maintaining the global connectivity, indicating the weak ties phenomenon in PPI networks. We further demonstrate that there is a negative relation between the weak tie strength and the topological similarity. By using the bridges, a reliable virtual network is constructed, in which each maximal clique corresponds to the core of a complex. By this notion, the detection of the protein complexes is transformed into a classic all-clique problem. A novel core-attachment based method is developed, which detects the cores and attachments, respectively. A comprehensive comparison among the existing algorithms and our algorithm has been made by comparing the predicted complexes against benchmark complexes.

Conclusions

We proved that the weak tie effect exists in the PPI network and demonstrated that the density is insufficient to characterize the topological structure of protein complexes. Furthermore, the experimental results on the yeast PPI network show that the proposed method outperforms the state-of-the-art algorithms. The analysis of detected modules by the present algorithm suggests that most of these modules have well biological significance in context of complexes, suggesting that the roles of edges are critical in discovering protein complexes.

     

Investigating the validity of current network analysis on static conglomerate networks by protein network stratification

Background  

A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform network analysis on a conglomerate network that is an assembly of all available binary interactions in a given organism from diverse data sources. Recent studies on network dynamics suggested that this approach might have ignored the dynamic nature of context-dependent molecular systems.     

Protein interaction networks in bacteria

The complement of expressed cellular proteins - the proteome - is organized into functional, structured networks of protein interactions that mediate assembly of molecular machines and dynamic cellular pathways. Recent studies reveal the biological roles of protein interactions in bacteriophage T7 and Helicobacter pylori, and new methods allow to compare and to predict interaction networks in other species. Smaller scale networks provide biological insights into DNA replication and chromosome dynamics in Bacillus subtilis and Archeoglobus fulgidus, and into the assembly of multiprotein complexes such as the type IV secretion system of Agrobacterium tumefaciens, and the cell division machinery of Escherichia coli. Genome-wide interaction networks in several species are needed to obtain a biologically meaningful view of the higher order organization of the proteome in bacteria.     

Cell type‐specific nuclear pores: a case in point for context‐dependent stoichiometry of molecular machines

To understand the structure and function of large molecular machines, accurate knowledge of their stoichiometry is essential. In this study, we developed an integrated targeted proteomics and super‐resolution microscopy approach to determine the absolute stoichiometry of the human nuclear pore complex (NPC), possibly the largest eukaryotic protein complex. We show that the human NPC has a previously unanticipated stoichiometry that varies across cancer cell types, tissues and in disease. Using large‐scale proteomics, we provide evidence that more than one third of the known, well‐defined nuclear protein complexes display a similar cell type‐specific variation of their subunit stoichiometry. Our data point to compositional rearrangement as a widespread mechanism for adapting the functions of molecular machines toward cell type‐specific constraints and context‐dependent needs, and highlight the need of deeper investigation of such structural variants.     

Machines vs. Ensembles: Effective MAPK Signaling through Heterogeneous Sets of Protein Complexes

Despite the importance of intracellular signaling networks, there is currently no consensus regarding the fundamental nature of the protein complexes such networks employ. One prominent view involves stable signaling machines with well-defined quaternary structures. The combinatorial complexity of signaling networks has led to an opposing perspective, namely that signaling proceeds via heterogeneous pleiomorphic ensembles of transient complexes. Since many hypotheses regarding network function rely on how we conceptualize signaling complexes, resolving this issue is a central problem in systems biology. Unfortunately, direct experimental characterization of these complexes has proven technologically difficult, while combinatorial complexity has prevented traditional modeling methods from approaching this question. Here we employ rule-based modeling, a technique that overcomes these limitations, to construct a model of the yeast pheromone signaling network. We found that this model exhibits significant ensemble character while generating reliable responses that match experimental observations. To contrast the ensemble behavior, we constructed a model that employs hierarchical assembly pathways to produce scaffold-based signaling machines. We found that this machine model could not replicate the experimentally observed combinatorial inhibition that arises when the scaffold is overexpressed. This finding provides evidence against the hierarchical assembly of machines in the pheromone signaling network and suggests that machines and ensembles may serve distinct purposes in vivo. In some cases, e.g. core enzymatic activities like protein synthesis and degradation, machines assembled via hierarchical energy landscapes may provide functional stability for the cell. In other cases, such as signaling, ensembles may represent a form of weak linkage, facilitating variation and plasticity in network evolution. The capacity of ensembles to signal effectively will ultimately shape how we conceptualize the function, evolution and engineering of signaling networks.     

A common neighbor based technique to detect protein complexes in PPI networks

Detection of protein complexes by analyzing and understanding PPI networks is an important task and critical to all aspects of cell biology. We present a technique called PROtein COmplex DEtection based on common neighborhood (PROCODE) that considers the inherent organization of protein complexes as well as the regions with heavy interactions in PPI networks to detect protein complexes. Initially, the core of the protein complexes is detected based on the neighborhood of PPI network. Then a merging strategy based on density is used to attach proteins and protein complexes to the core-protein complexes to form biologically meaningful structures. The predicted protein complexes of PROCODE was evaluated and analyzed using four PPI network datasets out of which three were from budding yeast and one from human. Our proposed technique is compared with some of the existing techniques using standard benchmark complexes and PROCODE was found to match very well with actual protein complexes in the benchmark data. The detected complexes were at par with existing biological evidence and knowledge.     

Detecting temporal protein complexes from dynamic protein-protein interaction networks

Background

Proteins dynamically interact with each other to perform their biological functions. The dynamic operations of protein interaction networks (PPI) are also reflected in the dynamic formations of protein complexes. Existing protein complex detection algorithms usually overlook the inherent temporal nature of protein interactions within PPI networks. Systematically analyzing the temporal protein complexes can not only improve the accuracy of protein complex detection, but also strengthen our biological knowledge on the dynamic protein assembly processes for cellular organization.

Results

In this study, we propose a novel computational method to predict temporal protein complexes. Particularly, we first construct a series of dynamic PPI networks by joint analysis of time-course gene expression data and protein interaction data. Then a Time Smooth Overlapping Complex Detection model (TS-OCD) has been proposed to detect temporal protein complexes from these dynamic PPI networks. TS-OCD can naturally capture the smoothness of networks between consecutive time points and detect overlapping protein complexes at each time point. Finally, a nonnegative matrix factorization based algorithm is introduced to merge those very similar temporal complexes across different time points.

Conclusions

Extensive experimental results demonstrate the proposed method is very effective in detecting temporal protein complexes than the state-of-the-art complex detection techniques.

Electronic supplementary material

The online version of this article (doi:10.1186/1471-2105-15-335) contains supplementary material, which is available to authorized users.     

The Evolutionary Dynamics of Protein-Protein Interaction Networks Inferred from the Reconstruction of Ancient Networks

Cellular functions are based on the complex interplay of proteins, therefore the structure and dynamics of these protein-protein interaction (PPI) networks are the key to the functional understanding of cells. In the last years, large-scale PPI networks of several model organisms were investigated. A number of theoretical models have been developed to explain both the network formation and the current structure. Favored are models based on duplication and divergence of genes, as they most closely represent the biological foundation of network evolution. However, studies are often based on simulated instead of empirical data or they cover only single organisms. Methodological improvements now allow the analysis of PPI networks of multiple organisms simultaneously as well as the direct modeling of ancestral networks. This provides the opportunity to challenge existing assumptions on network evolution. We utilized present-day PPI networks from integrated datasets of seven model organisms and developed a theoretical and bioinformatic framework for studying the evolutionary dynamics of PPI networks. A novel filtering approach using percolation analysis was developed to remove low confidence interactions based on topological constraints. We then reconstructed the ancient PPI networks of different ancestors, for which the ancestral proteomes, as well as the ancestral interactions, were inferred. Ancestral proteins were reconstructed using orthologous groups on different evolutionary levels. A stochastic approach, using the duplication-divergence model, was developed for estimating the probabilities of ancient interactions from today''s PPI networks. The growth rates for nodes, edges, sizes and modularities of the networks indicate multiplicative growth and are consistent with the results from independent static analysis. Our results support the duplication-divergence model of evolution and indicate fractality and multiplicative growth as general properties of the PPI network structure and dynamics.     

Vascular Endothelial Growth Factor (VEGF) Promotes Assembly of the p130Cas Interactome to Drive Endothelial Chemotactic Signaling and Angiogenesis

p130Cas is a polyvalent adapter protein essential for cardiovascular development, and with a key role in cell movement. In order to identify the pathways by which p130Cas exerts its biological functions in endothelial cells we mapped the p130Cas interactome and its dynamic changes in response to VEGF using high-resolution mass spectrometry and reconstruction of protein interaction (PPI) networks with the aid of multiple PPI databases. VEGF enriched the p130Cas interactome in proteins involved in actin cytoskeletal dynamics and cell movement, including actin-binding proteins, small GTPases and regulators or binders of GTPases. Detailed studies showed that p130Cas association of the GTPase-binding scaffold protein, IQGAP1, plays a key role in VEGF chemotactic signaling, endothelial polarization, VEGF-induced cell migration, and endothelial tube formation. These findings indicate a cardinal role for assembly of the p130Cas interactome in mediating the cell migratory response to VEGF in angiogenesis, and provide a basis for further studies of p130Cas in cell movement.     

A Novel Core‐Attachment–Based Method to Identify Dynamic Protein Complexes Based on Gene Expression Profiles and PPI Networks

Cellular functions are always performed by protein complexes. At present, many approaches have been proposed to identify protein complexes from protein–protein interaction (PPI) networks. Some approaches focus on detecting local dense subgraphs in PPI networks which are regarded as protein‐complex cores, then identify protein complexes by including local neighbors. However, from gene expression profiles at different time points or tissues it is known that proteins are dynamic. Therefore, identifying dynamic protein complexes should become very important and meaningful. In this study, a novel core‐attachment–based method named CO‐DPC to detect dynamic protein complexes is presented. First, CO‐DPC selects active proteins according to gene expression profiles and the 3‐sigma principle, and constructs dynamic PPI networks based on the co‐expression principle and PPI networks. Second, CO‐DPC detects local dense subgraphs as the cores of protein complexes and then attach close neighbors of these cores to form protein complexes. In order to evaluate the method, the method and the existing algorithms are applied to yeast PPI networks. The experimental results show that CO‐DPC performs much better than the existing methods. In addition, the identified dynamic protein complexes can match very well and thus become more meaningful for future biological study.     

Detecting complexes from edge-weighted PPI networks via genes expression analysis

Background

Identifying complexes from PPI networks has become a key problem to elucidate protein functions and identify signal and biological processes in a cell. Proteins binding as complexes are important roles of life activity. Accurate determination of complexes in PPI networks is crucial for understanding principles of cellular organization.

Results

We propose a novel method to identify complexes on PPI networks, based on different co-expression information. First, we use Markov Cluster Algorithm with an edge-weighting scheme to calculate complexes on PPI networks. Then, we propose some significant features, such as graph information and gene expression analysis, to filter and modify complexes predicted by Markov Cluster Algorithm. To evaluate our method, we test on two experimental yeast PPI networks.

Conclusions

On DIP network, our method has Precision and F-Measure values of 0.6004 and 0.5528. On MIPS network, our method has F-Measure and S _n values of 0.3774 and 0.3453. Comparing to existing methods, our method improves Precision value by at least 0.1752, F-Measure value by at least 0.0448, S _n value by at least 0.0771. Experiments show that our method achieves better results than some state-of-the-art methods for identifying complexes on PPI networks, with the prediction quality improved in terms of evaluation criteria.

     

Detecting overlapping protein complexes in PPI networks based on robustness

Background

Recently, large data sets of protein-protein interactions (PPI) which can be modeled as PPI networks are generated through high-throughput methods. And locally dense regions in PPI networks are very likely to be protein complexes. Since protein complexes play a key role in many biological processes, detecting protein complexes in PPI networks is one of important tasks in post-genomic era. However, PPI networks are often incomplete and noisy, which builds barriers to mining protein complexes.

Results

We propose a new and effective algorithm based on robustness to detect overlapping clusters as protein complexes in PPI networks. And in order to improve the accuracy of resulting clusters, our algorithm tries to reduce bad effects brought by noise in PPI networks. And in our algorithm, each new cluster begins from a seed and is expanded through adding qualified nodes from the cluster's neighbourhood nodes. Besides, in our algorithm, a new distance measurement method between a cluster K and a node in the neighbours of K is proposed as well. The performance of our algorithm is evaluated by applying it on two PPI networks which are Gavin network and Database of Interacting Proteins (DIP). The results show that our algorithm is better than Markov clustering algorithm (MCL), Clique Percolation method (CPM) and core-attachment based method (CoAch) in terms of F-measure, co-localization and Gene Ontology (GO) semantic similarity.

Conclusions

Our algorithm detects locally dense regions or clusters as protein complexes. The results show that protein complexes generated by our algorithm have better quality than those generated by some previous classic methods. Therefore, our algorithm is effective and useful.

     

Protein Complex Identification by Integrating Protein-Protein Interaction Evidence from Multiple Sources

Background

Understanding protein complexes is important for understanding the science of cellular organization and function. Many computational methods have been developed to identify protein complexes from experimentally obtained protein-protein interaction (PPI) networks. However, interaction information obtained experimentally can be unreliable and incomplete. Reconstructing these PPI networks with PPI evidences from other sources can improve protein complex identification.

Results

We combined PPI information from 6 different sources and obtained a reconstructed PPI network for yeast through machine learning. Some popular protein complex identification methods were then applied to detect yeast protein complexes using the new PPI networks. Our evaluation indicates that protein complex identification algorithms using the reconstructed PPI network significantly outperform ones on experimentally verified PPI networks.

Conclusions

We conclude that incorporating PPI information from other sources can improve the effectiveness of protein complex identification.     

Time-course network analysis reveals TNF-α can promote G1/S transition of cell cycle in vascular endothelial cells

MOTIVATION: Tumor necrosis factor-alpha (TNF-α), a major inflammatory cytokine, is closely related to several cardiovascular pathological processes. However, its effects on the cell cycle of vascular endothelial cells (VECs) have been the subject of some controversy. To investigate the molecular mechanism underlying this process, we constructed time-course protein-protein interaction (PPI) networks of TNF-α induced regulation of cell cycle in VECs using microarray datasets and genome-wide PPI datasets. Then, we analyzed the topological properties of the responsive PPI networks and calculated the node degree and node betweenness centralization of each gene in the networks. We found that p21, p27 and cyclinD1, key genes of the G1/S checkpoint, are in the center of responsive PPI networks and their roles in PPI networks are significantly altered with induction of TNF-α. According to the following biological experiments, we proved that TNF-α can promote G(1)/S transition of cell cycle in VECs and facilitate the cell cycle activation induced by vascular endothelial growth factor. CONTACT: shaoli@mail.tsinghua.edu.cn SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Regulation of integrin-mediated cellular responses through assembly of a CAS/Crk scaffold

The molecular coupling of CAS and Crk in response to integrin activation is an evolutionary conserved signaling module that controls cell proliferation, survival and migration. However, when deregulated, CAS/Crk signaling also contributes to cancer progression and developmental defects in humans. Here we highlight recent advances in our understanding of how CAS/Crk complexes assemble in cells to modulate the actin cytoskeleton, and the molecular mechanisms that regulate this process. We discuss in detail the spatiotemporal dynamics of CAS/Crk assembly and how this scaffold recruits specific effector proteins that couple integrin signaling networks to the migration machinery of cells. We also highlight the importance of CAS/Crk signaling in the dual regulation of cell migration and survival mechanisms that operate in invasive cells during development and pathological conditions associated with cancer metastasis.     

Protein complexes discovery based on protein-protein interaction data via a regularized sparse generative network model

Detecting protein complexes from protein interaction networks is one major task in the postgenome era. Previous developed computational algorithms identifying complexes mainly focus on graph partition or dense region finding. Most of these traditional algorithms cannot discover overlapping complexes which really exist in the protein-protein interaction (PPI) networks. Even if some density-based methods have been developed to identify overlapping complexes, they are not able to discover complexes that include peripheral proteins. In this study, motivated by recent successful application of generative network model to describe the generation process of PPI networks and to detect communities from social networks, we develop a regularized sparse generative network model (RSGNM), by adding another process that generates propensities using exponential distribution and incorporating Laplacian regularizer into an existing generative network model, for protein complexes identification. By assuming that the propensities are generated using exponential distribution, the estimators of propensities will be sparse, which not only has good biological interpretation but also helps to control the overlapping rate among detected complexes. And the Laplacian regularizer will lead to the estimators of propensities more smooth on interaction networks. Experimental results on three yeast PPI networks show that RSGNM outperforms six previous competing algorithms in terms of the quality of detected complexes. In addition, RSGNM is able to detect overlapping complexes and complexes including peripheral proteins simultaneously. These results give new insights about the importance of generative network models in protein complexes identification.