A survey of computational methods for protein complex prediction from protein interaction networks

AlphaFun: Structural-Alignment-Based Proteome Annotation Reveals why the Functionally Unknown Proteins (uPE1) Are So Understudied

With the rapid expansion of sequencing of genomes, the functional annotation of proteins becomes a bottleneck in understanding proteomes. The Chromosome-centric Human Proteome Project (C-HPP) aims to identify all proteins encoded by the human genome and find functional annotations for them. However, until now there are still 1137 identified human proteins without functional annotation, called uPE1 proteins. Sequence alignment was insufficient to predict their functions, and the crystal structures of most proteins were unavailable. In this study, we demonstrated a new functional annotation strategy, AlphaFun, based on structural alignment using deep-learning-predicted protein structures. Using this strategy, we functionally annotated 99% of the human proteome, including the uPE1 proteins and missing proteins, which have not been identified yet. The accuracy of the functional annotations was validated using the known-function proteins. The uPE1 proteins shared similar functions to the known-function PE1 proteins and tend to express only in very limited tissues. They are evolutionally young genes and thus should conduct functions only in specific tissues and conditions, limiting their occurrence in commonly studied biological models. Such functional annotations provide hints for functional investigations on the uPE1 proteins. This proteome-wide-scale functional annotation strategy is also applicable to any other species.

A partially shared joint clustering framework for detecting protein complexes from multiple state-specific signed interaction networks

Detecting protein complexes is critical for studying cellular organizations and functions. The accumulation of protein-protein interaction (PPI) data enables the identification of protein complexes computationally. Although a great number of computational methods have been proposed to identify protein complexes from PPI networks, most of them ignore the signs of PPIs that reflect the ways proteins interact (activation or inhibition). As not all PPIs imply co-complex relationships, taking into account the signs of PPIs can benefit the identification of protein complexes. Moreover, PPI networks are not static, but vary with the change of cell states or environments. However, existing methods are primarily designed for single-network clustering, and rarely consider joint clustering of multiple PPI networks. In this study, we propose a novel partially shared signed network clustering (PS-SNC) model for identifying protein complexes from multiple state-specific signed PPI networks jointly. PS-SNC can not only consider the signs of PPIs, but also identify the common and unique protein complexes in different states. Experimental results on synthetic and real datasets show that our PS-SNC model can achieve better performance than other state-of-the-art protein complex detection methods. Extensive analysis on real datasets demonstrate the effectiveness of PS-SNC in revealing novel insights about the underlying patterns of different cell lines.

Small protein complex prediction algorithm based on protein-protein interaction network segmentation

Background

Identifying protein complexes from protein-protein interaction network is one of significant tasks in the postgenome era. Protein complexes, none of which exceeds 10 in size play an irreplaceable role in life activities and are also a hotspot of scientific research, such as PSD-95, CD44, PKM2 and BRD4. And in MIPS, CYC2008, SGD, Aloy and TAP06 datasets, the proportion of small protein complexes is over 75%. But up to now, protein complex identification methods do not perform well in the field of small protein complexes.

Results

In this paper, we propose a novel method, called BOPS. It is a three-step procedure. Firstly, it calculates the balanced weights to replace the original weights. Secondly, it divides the graphs larger than MAXP until the original PPIN is divided into small PPINs. Thirdly, it enumerates the connected subset of each small PPINs, identifies potential protein complexes based on cohesion and removes those that are similar.

Conclusions

In four yeast PPINs, experimental results have shown that BOPS has an improvement of about 5% compared with the SOTA model. In addition, we constructed a weighted Homo sapiens PPIN based on STRINGdb and BioGRID, and BOPS gets the best result in it. These results give new insights into the identification of small protein complexes, and the weighted Homo sapiens PPIN provides more data for related research.

From communities to protein complexes: A local community detection algorithm on PPI networks

Identifying protein complexes in protein-protein interaction (ppi) networks is often handled as a community detection problem, with algorithms generally relying exclusively on the network topology for discovering a solution. The advancement of experimental techniques on ppi has motivated the generation of many Gene Ontology (go) databases. Incorporating the functionality extracted from go with the topological properties from the underlying ppi network yield a novel approach to identify protein complexes. Additionally, most of the existing algorithms use global measures that operate on the entire network to identify communities. The result of using global metrics are large communities that are often not correlated with the functionality of the proteins. Moreover, ppi network analysis shows that most of the biological functions possibly lie between local neighbours in ppi networks, which are not identifiable with global metrics. In this paper, we propose a local community detection algorithm, (lcda-go), that uniquely exploits information of functionality from go combined with the network topology. lcda-go identifies the community of each protein based on the topological and functional knowledge acquired solely from the local neighbour proteins within the ppi network. Experimental results using the Krogan dataset demonstrate that our algorithm outperforms in most cases state-of-the-art approaches in assessment based on Precision, Sensitivity, and particularly Composite Score. We also deployed lcda, the local-topology based precursor of lcda-go, to compare with a similar state-of-the-art approach that exclusively incorporates topological information of ppi networks for community detection. In addition to the high quality of the results, one main advantage of lcda-go is its low computational time complexity.

Defining and measuring probabilistic ego networks

Analyzing ego networks to investigate local properties and behaviors of individuals is a fundamental task in social network research. In this paper we show that there is not a unique way of defining ego networks when the existence of edges is uncertain, since there are two different ways of defining the neighborhood of a node in such network models. Therefore, we introduce two definitions of probabilistic ego networks, called V-Alters-Ego and F-Alters-Ego, both rooted in the literature. Following that, we investigate three fundamental measures (degree, betweenness and closeness) for each definition. We also propose a method to approximate betweenness of an ego node among the neighbors which are connected via shortest paths with length 2. We show that this approximation method is faster to compute and it has high correlation with ego betweenness under the V-Alters-Ego definition in many datasets. Therefore, it can be a reasonable alternative to represent the extent to which a node plays the role of an intermediate node among its neighbors.

Efficient and accurate identification of protein complexes from protein-protein interaction networks based on the clustering coefficient

•

Provided a family of efficient network algorithms for protein complex identification.

•

The parameter-free family outperforms existing approaches on different networks.

•

It exactly recovered ~ 35% of protein complexes in a pan-plant PPI network.

•

We examined of network perturbations on predicted protein complexes.

Identification of protein complexes from protein-protein interaction (PPI) networks is a key problem in PPI mining, solved by parameter-dependent approaches that suffer from small recall rates. Here we introduce GCC-v, a family of efficient, parameter-free algorithms to accurately predict protein complexes using the (weighted) clustering coefficient of proteins in PPI networks. Through comparative analyses with gold standards and PPI networks from Escherichia coli, Saccharomyces cerevisiae, and Homo sapiens, we demonstrate that GCC-v outperforms twelve state-of-the-art approaches for identification of protein complexes with respect to twelve performance measures in at least 85.71% of scenarios. We also show that GCC-v results in the exact recovery of ∼35% of protein complexes in a pan-plant PPI network and discover 144 new protein complexes in Arabidopsis thaliana, with high support from GO semantic similarity. Our results indicate that findings from GCC-v are robust to network perturbations, which has direct implications to assess the impact of the PPI network quality on the predicted protein complexes.

An interpretable machine learning method for homo-trimeric protein interface residue-residue interaction prediction

Protein-protein interaction plays an important role in life activities. A more fine-grained analysis, such as residues and atoms level, will better benefit us to understand the mechanism for inter-protein interaction and drug design. The development of efficient computational methods to reduce trials and errors, as well as assisting experimental researchers to determine the complex structure are some of the ongoing studies in the field. The research of trimer protein interface, especially homotrimer, has been rarely studied. In this paper, we proposed an interpretable machine learning method for homo-trimeric protein interface residue pairs prediction. The structure, sequence, and physicochemical information are intergraded as feature input fed to model for training. Graph model is utilized to present spatial information for intra-protein. Matrix factorization captures the different features' interactions. Kernel function is designed to auto-acquire the adjacent information of our target residue pairs. The accuracy rate achieves 54.5% in an independent test set. Sequence and structure alignment exhibit the ability of model self-study. Our model indicates the biological significance between sequence and structure, and could be auxiliary for reducing trials and errors in the fields of protein complex determination and protein-protein docking, etc. SIGNIFICANCE: Protein complex structures are significant for understanding protein function and promising functional protein design. With data increasing, some computational tools have been developed for protein complex residue contact prediction, which is one of the most significant steps for complex structure prediction. But for homo-trimeric protein, the sequence-based deep learning predictors are infeasible for homologous sequences, and the algorithm black box prevents us from understanding of each step operation. In this way, we propose an interpreting machine learning method for homo-trimeric protein interface residue-residue interaction prediction, and the predictor shows a good performance. Our work provides a computational auxiliary way for determining the homo-trimeric proteins interface residue pairs which will be further verified by wet experiments, and and gives a hand for the downstream works, such as protein-protein docking, protein complex structure prediction and drug design.

Protein Complexes Form a Basis for Complex Hybrid Incompatibility

Proteins are the workhorses of the cell and execute many of their functions by interacting with other proteins forming protein complexes. Multi-protein complexes are an admixture of subunits, change their interaction partners, and modulate their functions and cellular physiology in response to environmental changes. When two species mate, the hybrid offspring are usually inviable or sterile because of large-scale differences in the genetic makeup between the two parents causing incompatible genetic interactions. Such reciprocal-sign epistasis between inter-specific alleles is not limited to incompatible interactions between just one gene pair; and, usually involves multiple genes. Many of these multi-locus incompatibilities show visible defects, only in the presence of all the interactions, making it hard to characterize. Understanding the dynamics of protein-protein interactions (PPIs) leading to multi-protein complexes is better suited to characterize multi-locus incompatibilities, compared to studying them with traditional approaches of genetics and molecular biology. The advances in omics technologies, which includes genomics, transcriptomics, and proteomics can help achieve this end. This is especially relevant when studying non-model organisms. Here, we discuss the recent progress in the understanding of hybrid genetic incompatibility; omics technologies, and how together they have helped in characterizing protein complexes and in turn multi-locus incompatibilities. We also review advances in bioinformatic techniques suitable for this purpose and propose directions for leveraging the knowledge gained from model-organisms to identify genetic incompatibilities in non-model organisms.

PC2P: Parameter-free network-based prediction of protein complexes

Motivation

Prediction of protein complexes from protein–protein interaction (PPI) networks is an important problem in systems biology, as they control different cellular functions. The existing solutions employ algorithms for network community detection that identify dense subgraphs in PPI networks. However, gold standards in yeast and human indicate that protein complexes can also induce sparse subgraphs, introducing further challenges in protein complex prediction.

Results

To address this issue, we formalize protein complexes as biclique spanned subgraphs, which include both sparse and dense subgraphs. We then cast the problem of protein complex prediction as a network partitioning into biclique spanned subgraphs with removal of minimum number of edges, called coherent partition. Since finding a coherent partition is a computationally intractable problem, we devise a parameter-free greedy approximation algorithm, termed Protein Complexes from Coherent Partition (PC2P), based on key properties of biclique spanned subgraphs. Through comparison with nine contenders, we demonstrate that PC2P: (i) successfully identifies modular structure in networks, as a prerequisite for protein complex prediction, (ii) outperforms the existing solutions with respect to a composite score of five performance measures on 75% and 100% of the analyzed PPI networks and gold standards in yeast and human, respectively, and (iii,iv) does not compromise GO semantic similarity and enrichment score of the predicted protein complexes. Therefore, our study demonstrates that clustering of networks in terms of biclique spanned subgraphs is a promising framework for detection of complexes in PPI networks.

Availability and implementation

https://github.com/SaraOmranian/PC2P.

Supplementary information

Supplementary data are available at Bioinformatics online.

Protein Complexes Identification with Family-Wise Error Rate Control

The detection of protein complexes from protein-protein interaction network is a fundamental issue in bioinformatics and systems biology. To solve this problem, numerous methods have been proposed from different angles in the past decades. However, the study on detecting statistically significant protein complexes still has not received much attention. Although there are a few methods available in the literature for identifying statistically significant protein complexes, none of these methods can provide a more strict control on the error rate of a protein complex in terms of family-wise error rate (FWER). In this paper, we propose a new detection method SSF that is capable of controlling the FWER of each reported protein complex. More precisely, we first present a p-value calculation method based on Fisher's exact test to quantify the association between each protein and a given candidate protein complex. Consequently, we describe the key modules of the SSF algorithm: a seed expansion procedure for significant protein complexes search and a set cover strategy for redundancy elimination. The experimental results on five benchmark data sets show that: (1) our method can achieve the highest precision; (2) it outperforms three competing methods in terms of normalized mutual information (NMI) and F1 score in most cases.

Identification of Protein Complexes Based on Core-Attachment Structure and Combination of Centrality Measures and Biological Properties in PPI Weighted Networks

In protein interaction networks, a complex is a group of proteins that causes a biological process to take place. The correct identification of complexes can help to better understand function of cells used for therapeutic purposes, such as drug discoveries. This paper uses core-attachment structure, centrality measures, and biological properties of proteins to identify protein complex with the aim of enhancing prediction accuracy compared to related work. We used the inherent organization of complex to the identification in this article, while most methods have not considered such properties. On the other hand, clustering methods, as the common method for identifying complexes in protein interaction networks have been applied. However, we want to propose a method for more accurate identification of complexes in this article. Using this method, we determined the core center of each complex and its attachment proteins using the centrality measures, biological properties and weight density, whereby the weight of each interaction was calculated using the protein information in the gene ontology. In the proposed approach to weighting the network and measuring the importance of proteins, we used our previous work. To compare with other methods, we used datasets DIP, Collins, Krogan, and Human. The results show that the performance of our method was significantly improved, compared to other methods, in terms of detecting the protein complex. Using the p-value concept, we show the biological significance of our predicted complexes. The proposed method could identify an acceptable number of protein complexes, with the highest proportion of biological significance in collaborating on the functional annotation of proteins.

A comprehensive review and evaluation of computational methods for identifying protein complexes from protein-protein interaction networks

Protein complexes are the fundamental units for many cellular processes. Identifying protein complexes accurately is critical for understanding the functions and organizations of cells. With the increment of genome-scale protein-protein interaction (PPI) data for different species, various computational methods focus on identifying protein complexes from PPI networks. In this article, we give a comprehensive and updated review on the state-of-the-art computational methods in the field of protein complex identification, especially focusing on the newly developed approaches. The computational methods are organized into three categories, including cluster-quality-based methods, node-affinity-based methods and ensemble clustering methods. Furthermore, the advantages and disadvantages of different methods are discussed, and then, the performance of 17 state-of-the-art methods is evaluated on two widely used benchmark data sets. Finally, the bottleneck problems and their potential solutions in this important field are discussed.

Impact of low-confidence interactions on computational identification of protein complexes

Protein complexes are the cornerstones of most of the biological processes. Identifying protein complexes is crucial in understanding the principles of cellular organization with several important applications, including in disease diagnosis. Several computational techniques have been developed to identify protein complexes from protein-protein interaction (PPI) data (equivalently, from PPI networks). These PPI data have a significant amount of false positives, which is a bottleneck in identifying protein complexes correctly. Gene ontology (GO)-based semantic similarity measures can be used to assign a confidence score to PPIs. Consequently, low-confidence PPIs are highly likely to be false positives. In this paper, we systematically study the impact of low-confidence PPIs on the performance of complex detection methods using GO-based semantic similarity measures. We consider five state-of-the-art complex detection algorithms and nine GO-based similarity measures in the evaluation. We find that each complex detection algorithm significantly improves its performance after the filtration of low-similarity scored PPIs. It is also observed that the percentage improvement and the filtration percentage (of low-confidence PPIs) are highly correlated.

DPCT: A Dynamic Method for Detecting Protein Complexes From TAP-Aware Weighted PPI Network

Detecting protein complexes from the Protein-Protein interaction network (PPI) is the essence of discovering the rules of the cellular world. There is a large amount of PPI data available, generated from high throughput experimental data. The enormous size of the data persuaded us to use computational methods instead of experimental methods to detect protein complexes. In past years, many researchers presented their algorithms to detect protein complexes. Most of the presented algorithms use current static PPI networks. New researches proved the dynamicity of cellular systems, and so, the PPI is not static over time. In this paper, we introduce DPCT to detect protein complexes from dynamic PPI networks. In the proposed method, TAP and GO data are used to make a weighted PPI network and to reduce the noise of PPI. Gene expression data are also used to make dynamic subnetworks from PPI. A memetic algorithm is used to bicluster gene expression data and to create a dynamic subnetwork for each bicluster. Experimental results show that DPCT can detect protein complexes with better correctness than state-of-the-art detection algorithms. The source code and datasets of DPCT used can be found at https://github.com/alisn72/DPCT.

CDAP: An Online Package for Evaluation of Complex Detection Methods

Methods for detecting protein complexes from protein-protein interaction networks are of the most critical computational approaches. Numerous methods have been proposed in this area. Therefore, it is necessary to evaluate them. Various metrics have been proposed in order to compare these methods. Nevertheless, it is essential to define new metrics that evaluate methods both qualitatively and quantitatively. In addition, there is no tool for the comprehensive comparison of such methods. In this paper, a new criterion is introduced that can fully evaluate protein complex detection algorithms. We introduce CDAP (Complex Detection Analyzer Package); an online package for comparing protein complex detection methods. CDAP can quickly rank the performance of methods based on previously defined as well as newly introduced criteria in various settings (4 PPI datasets and 3 gold standards). It has the capability of integrating various methods and apply several filterings on the results. CDAP can be easily extended to include new datasets, gold standards, and methods. Furthermore, the user can compare the results of a custom method with the results of existing methods. Thus, the authors of future papers can use CDAP for comparing their method with the previous ones. A case study is done on YGR198W, a well-known protein, and the detected clusters are compared to the known complexes of this protein.

Exploration of attractor modules for sporadic amyotrophic lateral sclerosis via systemic module inference and attract method

Sporadic amyotrophic lateral sclerosis (SALS) is a devastating neurodegenerative disorder. However, the understanding of SALS is still poor. This research aimed to excavate attractor modules for SALS by integrating the systemic module inference and attract method. To achieve this, gene expression data and protein-protein data were recruited and preprocessed. Then, based on the Spearman's correlation coefficient (SCC) of the interactions under these two conditions, two PPI networks separately with 870 nodes (979 interactions) in normal control group and 601 nodes (777 interactions) in SALS group were built. Systemic module inference method was performed to identify the modules, and attract method was used to identify attractor modules. Finally, pathway enrichment analysis was performed to disclose the functional enrichment of these attractor modules. In total 44 and 118 modules were identified for normal control and SALS groups, respectively. Among them, 6 modules were with similar gene composition between the two groups, and all 6 modules were considered as the attractor module via attract method. These attractor modules might be potential biomarkers for early diagnosis and therapy of SALS, which could provide insight into the disease biology and suggest possible directions for drug screening programs.

Systematic tracking of altered modules identifies the key biomarkers involved in chronic lymphocytic leukemia

Key genes in chronic lymphocytic leukemia (CLL) were investigated through systematically tracking the dysregulated modules from protein-protein interaction (PPI) networks. Microarray data of normal subjects and CLL patients recruited from ArrayExpress database were applied to extract differentially expressed genes (DEGs). Additionally, we re-weighted the PPI network of normal and CLL conditions by means of Pearsons correlation coefficient (PCC). Furthermore, clique-merging method was applied to extract the modules and then the altered modules were screened out. The intersection genes were selected from miss and add genes in the altered modules. The common genes were screened from the intersection genes and DEGs in CLL. A total of 734 DEGs were screened by statistical analysis. In this investigation, there were 1,805 and 703 modules in normal as well as disease PPI network. In addition, 875 altered modules were obtained which included 145 miss genes, 353 add genes and 85 intersection genes. Finally, in-depth analysis revealed 9 mutual genes between the intersection genes and DEGs in CLL. Our analysis revealed several key genes associated with CLL by systematically tracking the dysregulated modules, which might be candidate targets for diagnosis and management of CLL.

Protein complex prediction: A survey

Protein complexes are one of the most important functional units for deriving biological processes within the cell. Experimental methods have provided valuable data to infer protein complexes. However, these methods have inherent limitations. Considering these limitations, many computational methods have been proposed to predict protein complexes, in the last decade. Almost all of these in-silico methods predict protein complexes from the ever-increasing protein-protein interaction (PPI) data. These computational approaches usually use the PPI data in the format of a huge protein-protein interaction network (PPIN) as input and output various sub-networks of the given PPIN as the predicted protein complexes. Some of these methods have already reached a promising efficiency in protein complex detection. Nonetheless, there are challenges in prediction of other types of protein complexes, specially sparse and small ones. New methods should further incorporate the knowledge of biological properties of proteins to improve the performance. Additionally, there are several challenges that should be considered more effectively in designing the new complex prediction algorithms in the future. This article not only reviews the history of computational protein complex prediction but also provides new insight for improvement of new methodologies. In this article, most important computational methods for protein complex prediction are evaluated and compared. In addition, some of the challenges in the reconstruction of the protein complexes are discussed. Finally, various tools for protein complex prediction and PPIN analysis as well as the current high-throughput databases are reviewed.

Protein complexes identification based on go attributed network embedding

Background

Identifying protein complexes from protein-protein interaction (PPI) network is one of the most important tasks in proteomics. Existing computational methods try to incorporate a variety of biological evidences to enhance the quality of predicted complexes. However, it is still a challenge to integrate different types of biological information into the complexes discovery process under a unified framework. Recently, attributed network embedding methods have be proved to be remarkably effective in generating vector representations for nodes in the network. In the transformed vector space, both the topological proximity and node attributed affinity between different nodes are preserved. Therefore, such attributed network embedding methods provide us a unified framework to integrate various biological evidences into the protein complexes identification process.

Results

In this article, we propose a new method called GANE to predict protein complexes based on Gene Ontology (GO) attributed network embedding. Firstly, it learns the vector representation for each protein from a GO attributed PPI network. Based on the pair-wise vector representation similarity, a weighted adjacency matrix is constructed. Secondly, it uses the clique mining method to generate candidate cores. Consequently, seed cores are obtained by ranking candidate cores based on their densities on the weighted adjacency matrix and removing redundant cores. For each seed core, its attachments are the proteins with correlation score that is larger than a given threshold. The combination of a seed core and its attachment proteins is reported as a predicted protein complex by the GANE algorithm. For performance evaluation, we compared GANE with six protein complex identification methods on five yeast PPI networks. Experimental results showes that GANE performs better than the competing algorithms in terms of different evaluation metrics.

Conclusions

GANE provides a framework that integrate many valuable and different biological information into the task of protein complex identification. The protein vector representation learned from our attributed PPI network can also be used in other tasks, such as PPI prediction and disease gene prediction.

Electronic supplementary material

The online version of this article (10.1186/s12859-018-2555-x) contains supplementary material, which is available to authorized users.

Integrating network topology, gene expression data and GO annotation information for protein complex prediction

The prediction of protein complexes based on the protein interaction network is a fundamental task for the understanding of cellular life as well as the mechanisms underlying complex disease. A great number of methods have been developed to predict protein complexes based on protein-protein interaction (PPI) networks in recent years. However, because the high throughput data obtained from experimental biotechnology are incomplete, and usually contain a large number of spurious interactions, most of the network-based protein complex identification methods are sensitive to the reliability of the PPI network. In this paper, we propose a new method, Identification of Protein Complex based on Refined Protein Interaction Network (IPC-RPIN), which integrates the topology, gene expression profiles and GO functional annotation information to predict protein complexes from the reconstructed networks. To demonstrate the performance of the IPC-RPIN method, we evaluated the IPC-RPIN on three PPI networks of Saccharomycescerevisiae and compared it with four state-of-the-art methods. The simulation results show that the IPC-RPIN achieved a better result than the other methods on most of the measurements and is able to discover small protein complexes which have traditionally been neglected.

Performance evaluation measures for protein complex prediction

Protein complexes play a dominant role in cellular organization and function. Prediction of protein complexes from the network of physical interactions between proteins (PPI networks) has thus become one of the important research areas. Recently, many computational approaches have been developed to identify these complexes. Various performance assessment measures have been proposed for evaluating the efficiency of these methods. However, there are many inconsistencies in the definitions and usage of the measures across the literature. To address this issue, we have gathered and presented the most important performance evaluation measures and developed a tool, named CompEvaluator, to critically assess the protein complex prediction methods. The tool and documentation are publicly available at https://sourceforge.net/projects/compevaluator/files/.

Reciprocal Perspective for Improved Protein-Protein Interaction Prediction

All protein-protein interaction (PPI) predictors require the determination of an operational decision threshold when differentiating positive PPIs from negatives. Historically, a single global threshold, typically optimized via cross-validation testing, is applied to all protein pairs. However, we here use data visualization techniques to show that no single decision threshold is suitable for all protein pairs, given the inherent diversity of protein interaction profiles. The recent development of high throughput PPI predictors has enabled the comprehensive scoring of all possible protein-protein pairs. This, in turn, has given rise to context, enabling us now to evaluate a PPI within the context of all possible predictions. Leveraging this context, we introduce a novel modeling framework called Reciprocal Perspective (RP), which estimates a localized threshold on a per-protein basis using several rank order metrics. By considering a putative PPI from the perspective of each of the proteins within the pair, RP rescores the predicted PPI and applies a cascaded Random Forest classifier leading to improvements in recall and precision. We here validate RP using two state-of-the-art PPI predictors, the Protein-protein Interaction Prediction Engine and the Scoring PRotein INTeractions methods, over five organisms: Homo sapiens, Saccharomyces cerevisiae, Arabidopsis thaliana, Caenorhabditis elegans, and Mus musculus. Results demonstrate the application of a post hoc RP rescoring layer significantly improves classification (p < 0.001) in all cases over all organisms and this new rescoring approach can apply to any PPI prediction method.

Identification of differential modules in ankylosing spondylitis using systemic module inference and the attract method

The objective of the present study was to identify differential modules in ankylosing spondylitis (AS) by integrating network analysis, module inference and the attract method. To achieve this objective, four steps were conducted. The first step was disease objective network (DON) for AS, and healthy objective network (HON) inference dependent on gene expression data, protein-protein interaction networks and Spearman's correlation coefficient. In the second step, module detection was performed by utilizing a clique-merging algorithm, which comprised of exploring maximal cliques by clique algorithm and refining or merging maximal cliques with a high overlap. The third part was seed module evaluation through module pair matches by Jaccard score and module correlation density (MCD) calculation. Finally, in the fourth step, differential modules between the AS and healthy groups were identified based on a gene set enrichment analysis-analysis of variance model in the attract method. There were 5,301 nodes and 28,176 interactions both in DON and HON. A total of 20 and 21 modules were detected for the AS and healthy group, respectively. Notably, six seed modules across two groups were identified with Jaccard score ≥0.5, and these were ranked in descending order of differential MCD (ΔC). Seed module 1 had the highest ΔC of 0.077 and Jaccard score of 1.000. By accessing the attract method, one differential module between the AS group and healthy group was identified. In conclusion, the present study successfully identified one differential module for AS that may be a potential marker for AS target therapy and provide insights for future research on this disease.

Differential network as an indicator of osteoporosis with network entropy

Osteoporosis is a common skeletal disorder characterized by a decrease in bone mass and density. The peak bone mass (PBM) is a significant determinant of osteoporosis. To gain insights into the indicating effect of PBM to osteoporosis, this study focused on characterizing the PBM networks and identifying key genes. One biological data set with 12 monocyte low PBM samples and 11 high PBM samples was derived to construct protein-protein interaction networks (PPINs). Based on clique-merging, module-identification algorithm was used to identify modules from PPINs. The systematic calculation and comparison were performed to test whether the network entropy can discriminate the low PBM network from high PBM network. We constructed 32 destination networks with 66 modules divided from monocyte low and high PBM networks. Among them, network 11 was the only significantly differential one (P<0.05) with 8 nodes and 28 edges. All genes belonged to precursors of osteoclasts, which were related to calcium transport as well as blood monocytes. In conclusion, based on the entropy in PBM PPINs, the differential network appears to be a novel therapeutic indicator for osteoporosis during the bone monocyte progression; these findings are helpful in disclosing the pathogenetic mechanisms of osteoporosis.

MTGO: PPI Network Analysis Via Topological and Functional Module Identification

Protein-protein interaction (PPI) networks are viable tools to understand cell functions, disease machinery, and drug design/repositioning. Interpreting a PPI, however, it is a particularly challenging task because of network complexity. Several algorithms have been proposed for an automatic PPI interpretation, at first by solely considering the network topology, and later by integrating Gene Ontology (GO) terms as node similarity attributes. Here we present MTGO - Module detection via Topological information and GO knowledge, a novel functional module identification approach. MTGO let emerge the bimolecular machinery underpinning PPI networks by leveraging on both biological knowledge and topological properties. In particular, it directly exploits GO terms during the module assembling process, and labels each module with its best fit GO term, easing its functional interpretation. MTGO shows largely better results than other state of the art algorithms (including recent GO-based ones) when searching for small or sparse functional modules, while providing comparable or better results all other cases. MTGO correctly identifies molecular complexes and literature-consistent processes in an experimentally derived PPI network of Myocardial infarction. A software version of MTGO is available freely for non-commercial purposes at https://gitlab.com/d1vella/MTGO .

RocSampler: regularizing overlapping protein complexes in protein-protein interaction networks

Background

In recent years, protein-protein interaction (PPI) networks have been well recognized as important resources to elucidate various biological processes and cellular mechanisms. In this paper, we address the problem of predicting protein complexes from a PPI network. This problem has two difficulties. One is related to small complexes, which contains two or three components. It is relatively difficult to identify them due to their simpler internal structure, but unfortunately complexes of such sizes are dominant in major protein complex databases, such as CYC2008. Another difficulty is how to model overlaps between predicted complexes, that is, how to evaluate different predicted complexes sharing common proteins because CYC2008 and other databases include such protein complexes. Thus, it is critical how to model overlaps between predicted complexes to identify them simultaneously.

Results

In this paper, we propose a sampling-based protein complex prediction method, RocSampler (Regularizing Overlapping Complexes), which exploits, as part of the whole scoring function, a regularization term for the overlaps of predicted complexes and that for the distribution of sizes of predicted complexes. We have implemented RocSampler in MATLAB and its executable file for Windows is available at the site, http://imi.kyushu-u.ac.jp/~om/software/RocSampler/.

Conclusions

We have applied RocSampler to five yeast PPI networks and shown that it is superior to other existing methods. This implies that the design of scoring functions including regularization terms is an effective approach for protein complex prediction.

Protein Complexes Prediction Method Based on Core-Attachment Structure and Functional Annotations

Recent advances in high-throughput laboratory techniques captured large-scale protein–protein interaction (PPI) data, making it possible to create a detailed map of protein interaction networks, and thus enable us to detect protein complexes from these PPI networks. However, most of the current state-of-the-art studies still have some problems, for instance, incapability of identifying overlapping clusters, without considering the inherent organization within protein complexes, and overlooking the biological meaning of complexes. Therefore, we present a novel overlapping protein complexes prediction method based on core–attachment structure and function annotations (CFOCM), which performs in two stages: first, it detects protein complex cores with the maximum value of our defined cluster closeness function, in which the proteins are also closely related to at least one common function. Then it appends attach proteins into these detected cores to form the returned complexes. For performance evaluation, CFOCM and six classical methods have been used to identify protein complexes on three different yeast PPI networks, and three sets of real complexes including the Munich Information Center for Protein Sequences (MIPS), the Saccharomyces Genome Database (SGD) and the Catalogues of Yeast protein Complexes (CYC2008) are selected as benchmark sets, and the results show that CFOCM is indeed effective and robust for achieving the highest F-measure values in all tests.

Identifying protein complexes in PPI network using non-cooperative sequential game

Identifying protein complexes from protein-protein interaction (PPI) network is an important and challenging task in computational biology as it helps in better understanding of cellular mechanisms in various organisms. In this paper we propose a noncooperative sequential game based model for protein complex detection from PPI network. The key hypothesis is that protein complex formation is driven by mechanism that eventually optimizes the number of interactions within the complex leading to dense subgraph. The hypothesis is drawn from the observed network property named small world. The proposed multi-player game model translates the hypothesis into the game strategies. The Nash equilibrium of the game corresponds to a network partition where each protein either belong to a complex or form a singleton cluster. We further propose an algorithm to find the Nash equilibrium of the sequential game. The exhaustive experiment on synthetic benchmark and real life yeast networks evaluates the structural as well as biological significance of the network partitions.

Observation of significant biomarkers in osteosarcoma via integrating module- identification method with attract

OBJECTIVE

Osteosarcoma (OS) is the most frequent type of bone malignancy, and this disease has a poor prognosis. We aimed to identify the significant genes related with OS by integrating module-identification method and attract approach.

METHODS

OS-related microarray data E-GEOD-36001 were obtained from ArrayExpress database, and then protein-protein interaction (PPI) networks of normal and OS were re-weighted by means of spearman correlation coefficient (SCC). Next, maximal cliques were detected from the re-weighted PPI networks using clusteringbased on maximal cliques approach. Afterwards, highly overlapped cliques were merged according to the interconnectivity, following by candidate modules and seed modules identification. Attract proposed by Mar et al. who have suggested that this approach can extract and annotate the gene-sets which can distinguish between disease and control samples, and obtained differences of these gene-sets among the expression profile of samples were defined as attractors. Thus, we applied attract method to extract differential modules from the seed modules, and these obtained differential modules were defined as attractors. The genes in attractors were determined as attractor genes.

RESULTS

After eliminating the maximal cliques with nodes less than 4, there were 1,884 and 528 maximal cliques in normal and OS PPI networks, which were used to conduct module analysis. A total of 60 and 19 candidate modules were obtained in control and OS PPI networks, respectively. By comparing with normal group, 2 seed module pairs with similar gene composition were found. Significantly, based on attract method, we found that these 2 modules were differential. These 2 modules had the same gene size with 4 genes. Of note, genes CCNB1 and KIF11 simultaneously appeared in these two attractors.

CONCLUSIONS

We successfully identified two attractors via integrating module-identification method and attract approach, and attractor genes, for example, CCNB1 and KIF11 might play pathophysiological roles in OS development and progression.

A novel method to identify hub pathways of rheumatoid arthritis based on differential pathway networks

The aim of the current study was to identify hub pathways of rheumatoid arthritis (RA) using a novel method based on differential pathway network (DPN) analysis. The present study proposed a DPN where protein-protein interaction (PPI) network was integrated with pathway-pathway interactions. Pathway data was obtained from background PPI network and the Reactome pathway database. Subsequently, pathway interactions were extracted from the pathway data by building randomized gene-gene interactions and a weight value was assigned to each pathway interaction using Spearman correlation coefficient (SCC) to identify differential pathway interactions. Differential pathway interactions were visualized using Cytoscape to construct a DPN. Topological analysis was conducted to identify hub pathways that possessed the top 5% degree distribution of DPN. Modules of DPN were mined according to ClusterONE. A total of 855 pathways were selected to build pathway interactions. By filtrating pathway interactions of weight values >0.7, a DPN with 312 nodes and 791 edges was obtained. Topological degree analysis revealed 15 hub pathways, such as heparan sulfate/heparin-glycosaminoglycan (HS-GAG) degradation, HS-GAG metabolism and keratan sulfate degradation for RA based on DPN. Furthermore, hub pathways were also important in modules, which validated the significance of hub pathways. In conclusion, the proposed method is a computationally efficient way to identify hub pathways of RA, which identified 15 hub pathways that may be potential biomarkers and provide insight to future investigation and treatment of RA.

Discovering overlapped protein complexes from weighted PPI networks by removing inter-module hubs

Detecting known protein complexes and predicting undiscovered protein complexes from protein-protein interaction (PPI) networks help us to understand principles of cell organization and its functions. Nevertheless, the discovery of protein complexes based on experiment still needs to be explored. Therefore, computational methods are useful approaches to overcome the experimental limitations. Nevertheless, extraction of protein complexes from PPI network is often nontrivial. Two major constraints are large amount of noise and ignorance of occurrence time of different interactions in PPI network. In this paper, an efficient algorithm, Inter Module Hub Removal Clustering (IMHRC), is developed based on inter-module hub removal in the weighted PPI network which can detect overlapped complexes. By removing some of the inter-module hubs and module hubs, IMHRC eliminates high amount of noise in dataset and implicitly considers different occurrence time of the PPI in network. The performance of the IMHRC was evaluated on several benchmark datasets and results were compared with some of the state-of-the-art models. The protein complexes discovered with the IMHRC method show significantly better agreement with the real complexes than other current methods. Our algorithm provides an accurate and scalable method for detecting and predicting protein complexes from PPI networks.

From protein-protein interactions to protein co-expression networks: a new perspective to evaluate large-scale proteomic data

The reductionist approach of dissecting biological systems into their constituents has been successful in the first stage of the molecular biology to elucidate the chemical basis of several biological processes. This knowledge helped biologists to understand the complexity of the biological systems evidencing that most biological functions do not arise from individual molecules; thus, realizing that the emergent properties of the biological systems cannot be explained or be predicted by investigating individual molecules without taking into consideration their relations. Thanks to the improvement of the current -omics technologies and the increasing understanding of the molecular relationships, even more studies are evaluating the biological systems through approaches based on graph theory. Genomic and proteomic data are often combined with protein-protein interaction (PPI) networks whose structure is routinely analyzed by algorithms and tools to characterize hubs/bottlenecks and topological, functional, and disease modules. On the other hand, co-expression networks represent a complementary procedure that give the opportunity to evaluate at system level including organisms that lack information on PPIs. Based on these premises, we introduce the reader to the PPI and to the co-expression networks, including aspects of reconstruction and analysis. In particular, the new idea to evaluate large-scale proteomic data by means of co-expression networks will be discussed presenting some examples of application. Their use to infer biological knowledge will be shown, and a special attention will be devoted to the topological and module analysis.

Cardioprotection Effects of Sevoflurane by Regulating the Pathway of Neuroactive Ligand-Receptor Interaction in Patients Undergoing Coronary Artery Bypass Graft Surgery

This study was designed to identify attractor modules and further reveal the potential biological processes involving in sevoflurane-induced anesthesia in patients treated with coronary artery bypass graft (CABG) surgery. Microarray profile data (ID: E-GEOD-4386) on atrial samples obtained from patients receiving anesthetic gas sevoflurane prior to and following CABG procedure were downloaded from EMBL-EBI database for further analysis. Protein-protein interaction (PPI) networks of baseline and sevoflurane groups were inferred and reweighted according to Spearman correlation coefficient (SCC), followed by systematic modules inference using clique-merging approach. Subsequently, attract method was utilized to explore attractor modules. Finally, pathway enrichment analyses for genes in the attractor modules were implemented to illuminate the biological processes in sevoflurane group. Using clique-merging approach, 27 and 36 modules were obtained from the PPI networks of baseline and sevoflurane-treated samples, respectively. By comparing with the baseline condition, 5 module pairs with the same gene composition were identified. Subsequently, 1 out of 5 modules was identified as an attractor based on attract method. Additionally, pathway analysis indicated that genes in the attractor module were associated with neuroactive ligand-receptor interaction. Accordingly, sevoflurane might exert important functions in cardioprotection in patients following CABG, partially through regulating the pathway of neuroactive ligand-receptor interaction.

HAPPI-2: a Comprehensive and High-quality Map of Human Annotated and Predicted Protein Interactions

BACKGROUND

Human protein-protein interaction (PPI) data is essential to network and systems biology studies. PPI data can help biochemists hypothesize how proteins form complexes by binding to each other, how extracellular signals propagate through post-translational modification of de-activated signaling molecules, and how chemical reactions are coupled by enzymes involved in a complex biological process. Our capability to develop good public database resources for human PPI data has a direct impact on the quality of future research on genome biology and medicine.

RESULTS

The database of Human Annotated and Predicted Protein Interactions (HAPPI) version 2.0 is a major update to the original HAPPI 1.0 database. It contains 2,922,202 unique protein-protein interactions (PPI) linked by 23,060 human proteins, making it the most comprehensive database covering human PPI data today. These PPIs contain both physical/direct interactions and high-quality functional/indirect interactions. Compared with the HAPPI 1.0 database release, HAPPI database version 2.0 (HAPPI-2) represents a 485% of human PPI data coverage increase and a 73% protein coverage increase. The revamped HAPPI web portal provides users with a friendly search, curation, and data retrieval interface, allowing them to retrieve human PPIs and available annotation information on the interaction type, interaction quality, interacting partner drug targeting data, and disease information. The updated HAPPI-2 can be freely accessed by Academic users at http://discovery.informatics.uab.edu/HAPPI .

CONCLUSIONS

While the underlying data for HAPPI-2 are integrated from a diverse data sources, the new HAPPI-2 release represents a good balance between data coverage and data quality of human PPIs, making it ideally suited for network biology.

Personalized Identification of Differentially Expressed Modules in Osteosarcoma

BACKGROUND Osteosarcoma (OS), an aggressive malignant neoplasm, is the most common primary bone cancer mainly in adolescents and young adults. Differentially expressed modules tend to distinguish differences integrally. Identifying modules individually has been crucial for understanding OS mechanisms and applications of custom therapeutic decisions in the future. MATERIAL AND METHODS Samples came from individuals were used from control group (n=15) and OS group (n=84). Based on clique-merging, module-identification algorithm was used to identify modules from OS PPI networks. A novel approach - the individualized module aberrance score (iMAS) was performed to distinguish differences, making special use of accumulated normal samples (ANS). We performed biological process ontology to classify functionally modules. Then Support Vector Machine (SVM) was used to test distribution results of normal and OS group with screened modules. RESULTS We identified 83 modules containing 2084 genes from PPI network in which 61 modules were significantly different. Cluster analysis of OS using the iMAS method identified 5 modules clusters. Specificity=1.00 and Sensitivity=1.00 proved the distribution outcomes of screened modules were mainly consistent with that of total data, which suggested the efficiency of 61 modules. CONCLUSIONS We conclude that a novel pipeline that identified the dysregulated modules in individuals of OS. The constructed process is expected to aid in personalized health care, which may present fruitful strategies for medical therapy.

Protein complex prediction for large protein protein interaction networks with the Core&Peel method

Background

Biological networks play an increasingly important role in the exploration of functional modularity and cellular organization at a systemic level. Quite often the first tools used to analyze these networks are clustering algorithms. We concentrate here on the specific task of predicting protein complexes (PC) in large protein-protein interaction networks (PPIN). Currently, many state-of-the-art algorithms work well for networks of small or moderate size. However, their performance on much larger networks, which are becoming increasingly common in modern proteome-wise studies, needs to be re-assessed.

Results and discussion

We present a new fast algorithm for clustering large sparse networks: Core&Peel, which runs essentially in time and storage O(a(G)m+n) for a network G of n nodes and m arcs, where a(G) is the arboricity of G (which is roughly proportional to the maximum average degree of any induced subgraph in G). We evaluated Core&Peel on five PPI networks of large size and one of medium size from both yeast and homo sapiens, comparing its performance against those of ten state-of-the-art methods. We demonstrate that Core&Peel consistently outperforms the ten competitors in its ability to identify known protein complexes and in the functional coherence of its predictions. Our method is remarkably robust, being quite insensible to the injection of random interactions. Core&Peel is also empirically efficient attaining the second best running time over large networks among the tested algorithms.

Conclusions

Our algorithm Core&Peel pushes forward the state-of the-art in PPIN clustering providing an algorithmic solution with polynomial running time that attains experimentally demonstrable good output quality and speed on challenging large real networks.

Electronic supplementary material

The online version of this article (doi:10.1186/s12859-016-1191-6) contains supplementary material, which is available to authorized users.

Global profiling of protein complexes: current approaches and their perspective in biomedical research

INTRODUCTION

Despite the rapid evolution of proteomic methods, protein interactions and their participation in protein complexes - an important aspect of their function - has rarely been investigated on the proteome-wide level. Disease states, such as muscular dystrophy or viral infection, are induced by interference in protein-protein interactions within complexes. The purpose of this review is to describe the current methods for global complexome analysis and to critically discuss the challenges and opportunities for the application of these methods in biomedical research. Areas covered: We discuss advancements in experimental techniques and computational tools that facilitate profiling of the complexome. The main focus is on the separation of native protein complexes via size exclusion chromatography and gel electrophoresis, which has recently been combined with quantitative mass spectrometry, for a global protein-complex profiling. The development of this approach has been supported by advanced bioinformatics strategies and fast and sensitive mass spectrometers that have allowed the analysis of whole cell lysates. The application of this technique to biomedical research is assessed, and future directions are anticipated. Expert commentary: The methodology is quite new, and has already shown great potential when combined with complementary methods for detection of protein complexes.

LPRP: A Gene-Gene Interaction Network Construction Algorithm and Its Application in Breast Cancer Data Analysis

The importance of the construction of gene-gene interaction (GGI) network to better understand breast cancer has previously been highlighted. In this study, we propose a novel GGI network construction method called linear and probabilistic relations prediction (LPRP) and used it for gaining system level insight into breast cancer mechanisms. We construct separate genome-wide GGI networks for tumor and normal breast samples, respectively, by applying LPRP on their gene expression datasets profiled by The Cancer Genome Atlas. According to our analysis, a large loss of gene interactions in the tumor GGI network was observed (7436; 88.7 % reduction), which also contained fewer functional genes (4757; 32 % reduction) than the normal network. Tumor GGI network was characterized by a bigger network diameter and a longer characteristic path length but a smaller clustering coefficient and much sparse network connections. In addition, many known cancer pathways, especially immune response pathways, are enriched by genes in the tumor GGI network. Furthermore, potential cancer genes are filtered in this study, which may act as drugs targeting genes. These findings will allow for a better understanding of breast cancer mechanisms.

Systematic tracking of disrupted modules identifies significant genes and pathways in hepatocellular carcinoma

The objective of the present study is to identify significant genes and pathways associated with hepatocellular carcinoma (HCC) by systematically tracking the dysregulated modules of re-weighted protein-protein interaction (PPI) networks. Firstly, normal and HCC PPI networks were inferred and re-weighted based on Pearson correlation coefficient. Next, modules in the PPI networks were explored by a clique-merging algorithm, and disrupted modules were identified utilizing a maximum weight bipartite matching in non-increasing order. Then, the gene compositions of the disrupted modules were studied and compared with differentially expressed (DE) genes, and pathway enrichment analysis for these genes was performed based on Expression Analysis Systematic Explorer. Finally, validations of significant genes in HCC were conducted using reverse transcription-quantitative polymerase chain reaction (RT-qPCR) analysis. The present study evaluated 394 disrupted module pairs, which comprised 236 dysregulated genes. When the dysregulated genes were compared with 211 DE genes, a total of 26 common genes [including phospholipase C beta 1, cytochrome P450 (CYP) 2C8 and CYP2B6] were obtained. Furthermore, 6 of these 26 common genes were validated by RT-qPCR. Pathway enrichment analysis of dysregulated genes demonstrated that neuroactive ligand-receptor interaction, purine and drug metabolism, and metabolism of xenobiotics mediated by CYP were significantly disrupted pathways. In conclusion, the present study greatly improved the understanding of HCC in a systematic manner and provided potential biomarkers for early detection and novel therapeutic methods.

Multiplex matrix network analysis of protein complexes in the human TCR signalosome

Multiprotein complexes transduce cellular signals through extensive interaction networks, but the ability to analyze these networks in cells from small clinical biopsies is limited. To address this, we applied an adaptable multiplex matrix system to physiologically relevant signaling protein complexes isolated from a cell line or from human patient samples. Focusing on the proximal T cell receptor (TCR) signalosome, we assessed 210 pairs of PiSCES (proteins in shared complexes detected by exposed surface epitopes). Upon stimulation of Jurkat cells with superantigen-loaded antigen-presenting cells, this system produced high-dimensional data that enabled visualization of network activity. A comprehensive analysis platform generated PiSCES biosignatures by applying unsupervised hierarchical clustering, principal component analysis, an adaptive nonparametric with empirical cutoff analysis, and weighted correlation network analysis. We generated PiSCES biosignatures from 4-mm skin punch biopsies from control patients or patients with the autoimmune skin disease alopecia areata. This analysis distinguished disease patients from the controls, detected enhanced basal TCR signaling in the autoimmune patients, and identified a potential signaling network signature that may be indicative of disease. Thus, generation of PiSCES biosignatures represents an approach that can provide information about the activity of protein signaling networks in samples including low-abundance primary cells from clinical biopsies.

BiCAMWI: A Genetic-Based Biclustering Algorithm for Detecting Dynamic Protein Complexes

Considering the roles of protein complexes in many biological processes in the cell, detection of protein complexes from available protein-protein interaction (PPI) networks is a key challenge in the post genome era. Despite high dynamicity of cellular systems and dynamic interaction between proteins in a cell, most computational methods have focused on static networks which cannot represent the inherent dynamicity of protein interactions. Recently, some researchers try to exploit the dynamicity of PPI networks by constructing a set of dynamic PPI subnetworks correspondent to each time-point (column) in a gene expression data. However, many genes can participate in multiple biological processes and cellular processes are not necessarily related to every sample, but they might be relevant only for a subset of samples. So, it is more interesting to explore each subnetwork based on a subset of genes and conditions (i.e., biclusters) in a gene expression data. Here, we present a new method, called BiCAMWI to employ dynamicity in detecting protein complexes. The preprocessing phase of the proposed method is based on a novel genetic algorithm that extracts some sets of genes that are co-regulated under some conditions from input gene expression data. Each extracted gene set is called bicluster. In the detection phase of the proposed method, then, based on the biclusters, some dynamic PPI subnetworks are extracted from input static PPI network. Protein complexes are identified by applying a detection method on each dynamic PPI subnetwork and aggregating the results. Experimental results confirm that BiCAMWI effectively models the dynamicity inherent in static PPI networks and achieves significantly better results than state-of-the-art methods. So, we suggest BiCAMWI as a more reliable method for protein complex detection.

Identifying disrupted pathways by tracking altered modules in type 2 DM-related heart failure

BACKGROUND

This study aimed to screen disrupted pathways in type 2 diabetes mellitus (T2DM) heart failure by systematically tracking the altered modules of reweighted protein-protein interaction (PPI) networks.

METHODS

We implemented systematic identification and comparison of modules across non-T2DM and T2DM heart failure subjects by integrating gene expression data and PPI networks. The PPI networks of non-T2DM heart failure and T2DM heart failure were constructed and reweighted by means of Spearman's correlation coefficient (SCC). Subsequently, a clique-merging algorithm was used to explore the modules in the PPI network, followed by the identification of disrupted modules based on a maximum-weight bipartite matching and sorting in descending order. Finally, pathway enrichment analyses were conducted for genes in disrupted modules to determine the biological pathways in T2DM heart failure.

RESULTS

By comparing the modules of non-T2DM heart failure and T2DM heart failure, 804 disrupted modules were explored. The genes in disrupted modules were significantly enriched in 39 categories (p < 1.00E-06). Of these, the most significant pathways were the focal adhesion, vascular endothelial growth factor (VEGF) signaling, and mitogen-activated protein kinase (MAPK) signaling pathways.

CONCLUSION

The identified disrupted pathways - focal adhesion, VEGF signaling, and MAPK signaling - might play important roles in the progression of T2DM heart failure.