Modularity in protein complex and drug interactions reveals new polypharmacological properties

Relation Extraction of Protein Complexes from Dynamic Protein-Protein Interaction Network

Background

Dynamic protein-protein interaction networks (DPPIN) can confirm the conditional and temporal features of proteins and protein complexes. In addition, the relation of protein complexes in dynamic networks can provide useful information in understanding the dynamic functionality of PPI networks.

Objective

In this paper, an algorithm is presented to discover the temporal association rule from the dynamic PPIN dataset.

Material and Methods

In this analytical study, the static protein-protein interaction network is transformed into a dynamic network using the gene expression thresholding to extract the protein complex relations. The number of presented proteins of the dynamic network is large at each time point. This number will increase for extraction of multidimensional rules at different times. By mapping the gold standard protein complexes as reference protein complexes, the number of items decreases from active proteins to protein complexes at each transaction. Extracted sub graphs as protein complexes, at each time point, are weighted according to the reference protein complexes similarity degrees. Mega-transactions and extended items are created based on occurrence bitmap matrix of the reference complexes. Rules will be extracted based on Mega-transactions of protein complexes.

Results

The proposed method has been evaluated using gold standard protein complex rules. The amount of extracted rules from Biogrid datasets and protein complexes are 281, with support 0.2.

Conclusion

The characteristic of the proposed algorithm is the simultaneous extraction of intra-transaction and inter-transaction rules. The results evaluation using EBI data shows the efficiency of the proposed algorithm.

Overlapping Community Detection of Bipartite Networks Based on a Novel Community Density

Community detection plays an essential role in understanding network topology and mining underlying information. A bipartite network is a complex network with more important authenticity and applicability than a one-mode network in the real world. There are many communities in the network that present natural overlapping structures in the real world. However, most of the research focuses on detecting non-overlapping community structures in the bipartite network, and the resolution of the existing evaluation function for the community structure’s merits are limited. So, we propose a novel function for community detection and evaluation of the bipartite network, called community density D. And based on community density, a bipartite network community detection algorithm DSNE (Density Sub-community Node-pair Extraction) is proposed, which is effective for overlapping community detection from a micro point of view. The experiments based on artificially-generated networks and real-world networks show that the DSNE algorithm is superior to some existing excellent algorithms; in comparison, the community density (D) is better than the bipartite network’s modularity.

Community detection in bipartite networks with stochastic block models

In bipartite networks, community structures are restricted to being disassortative, in that nodes of one type are grouped according to common patterns of connection with nodes of the other type. This makes the stochastic block model (SBM), a highly flexible generative model for networks with block structure, an intuitive choice for bipartite community detection. However, typical formulations of the SBM do not make use of the special structure of bipartite networks. Here we introduce a Bayesian nonparametric formulation of the SBM and a corresponding algorithm to efficiently find communities in bipartite networks which parsimoniously chooses the number of communities. The biSBM improves community detection results over general SBMs when data are noisy, improves the model resolution limit by a factor of sqrt[2], and expands our understanding of the complicated optimization landscape associated with community detection tasks. A direct comparison of certain terms of the prior distributions in the biSBM and a related high-resolution hierarchical SBM also reveals a counterintuitive regime of community detection problems, populated by smaller and sparser networks, where nonhierarchical models outperform their more flexible counterpart.

Efficient Detection of Communities in Biological Bipartite Networks

Methods to efficiently uncover and extract community structures are required in a number of biological applications where networked data and their interactions can be modeled as graphs, and observing tightly-knit groups of vertices ("communities") can offer insights into the structural and functional building blocks of the underlying network. Classical applications of community detection have largely focused on unipartite networks - i.e., graphs built out of a single type of objects. However, due to increased availability of biological data from various sources, there is now an increasing need for handling heterogeneous networks which are built out of multiple types of objects. In this paper, we address the problem of identifying communities from biological bipartite networks - i.e., networks where interactions are observed between two different types of objects (e.g., genes and diseases, drugs and protein complexes, plants and pollinators, and hosts and pathogens). Toward detecting communities in such bipartite networks, we make the following contributions: i) (metric) we propose a variant of bipartite modularity; ii) (algorithms) we present an efficient algorithm called biLouvain that implements a set of heuristics toward fast and precise community detection in bipartite networks (https://github.com/paolapesantez/biLouvain); and iii) (experiments) we present a thorough experimental evaluation of our algorithm including comparison to other state-of-the-art methods to identify communities in bipartite networks. Experimental results show that our biLouvain algorithm identifies communities that have a comparable or better quality (as measured by bipartite modularity) than existing methods, while significantly reducing the time-to-solution between one and four orders of magnitude.

Toward Large-Scale Computational Prediction of Protein Complexes

Cellular functions are often performed by multiprotein structures called protein complexes. These complexes are dynamic structures that evolve during the cell cycle or in response to external and internal stimuli, and are tightly regulated by protein expression in different tissues resulting in quantitative and qualitative variation of protein complexes. Advances in high-throughput techniques, such as mass-spectrometry and yeast two-hybrid provided a large amount of data on protein-protein interactions. This sparked the development of computational methods able to predict protein complex formation under a variety of biological and clinical conditions. However, the challenges that need to be addressed for successful computational protein complex prediction are highly complex.The post-genomic era saw an emerging number of algorithms and software, which are able to predict protein complexes from protein-protein interaction networks and a variety of other sources. Despite the high capacity of these methods to qualitatively predict protein complexes, they could provide only limited or no quantitative information of the predicted complexes. Recently, a new large-scale simulation of protein complexes was able to achieve this task by simulating protein complex formation on the proteome scale.In this chapter, we review representative methods that can predict multiple protein complexes at different scales and discuss how these can be combined with emerging sources of data in order to improve protein complex characterization.

Identify bilayer modules via pseudo-3D clustering: applications to miRNA-gene bilayer networks

Module identification is a frequently used approach for mining local structures with more significance in global networks. Recently, a wide variety of bilayer networks are emerging to characterize the more complex biological processes. In the light of special topological properties of bilayer networks and the accompanying challenges, there is yet no effective method aiming at bilayer module identification to probe the modular organizations from the more inspiring bilayer networks. To this end, we proposed the pseudo-3D clustering algorithm, which starts from extracting initial non-hierarchically organized modules and then iteratively deciphers the hierarchical organization of modules according to a bottom-up strategy. Specifically, a modularity function for bilayer modules was proposed to facilitate the algorithm reporting the optimal partition that gives the most accurate characterization of the bilayer network. Simulation studies demonstrated its robustness and outperformance against alternative competing methods. Specific applications to both the soybean and human miRNA-gene bilayer networks demonstrated that the pseudo-3D clustering algorithm successfully identified the overlapping, hierarchically organized and highly cohesive bilayer modules. The analyses on topology, functional and human disease enrichment and the bilayer subnetwork involved in soybean fat biosynthesis provided both the theoretical and biological evidence supporting the effectiveness and robustness of pseudo-3D clustering algorithm.

Quantitative Identification of Compound-Dependent On-Modules and Differential Allosteric Modules From Homologous Ischemic Networks

Module‐based methods have made much progress in deconstructing biological networks. However, it is a great challenge to quantitatively compare the topological structural variations of modules (allosteric modules [AMs]) under different situations. A total of 23, 42, and 15 coexpression modules were identified in baicalin (BA), jasminoidin (JA), and ursodeoxycholic acid (UA) in a global anti‐ischemic mice network, respectively. Then, we integrated the methods of module‐based consensus ratio (MCR) and modified Z_summary module statistic to validate 12 BA, 22 JA, and 8 UA on‐modules based on comparing with vehicle. The MCRs for pairwise comparisons were 1.55% (BA vs. JA), 1.45% (BA vs. UA), and 1.27% (JA vs. UA), respectively. Five conserved allosteric modules (CAMs) and 17 unique allosteric modules (UAMs) were identified among these groups. In conclusion, module‐centric analysis may provide us a unique approach to understand multiple pharmacological mechanisms associated with differential phenotypes in the era of modular pharmacology.

Target-Based Drug Repositioning Using Large-Scale Chemical-Protein Interactome Data

Drug repositioning, or the identification of new indications for known drugs, is a useful strategy for drug discovery. In this study, we developed novel computational methods to predict potential drug targets and new drug indications for systematic drug repositioning using large-scale chemical-protein interactome data. We explored the target space of drugs (including primary targets and off-targets) based on chemical structure similarity and phenotypic effect similarity by making optimal use of millions of compound-protein interactions. On the basis of the target profiles of drugs, we constructed statistical models to predict new drug indications for a wide range of diseases with various molecular features. The proposed method outperformed previous methods in terms of interpretability, applicability, and accuracy. Finally, we conducted a comprehensive prediction of the drug-target-disease association network for 8270 drugs and 1401 diseases and showed biologically meaningful examples of newly predicted drug targets and drug indications. The predictive model is useful to understand the mechanisms of the predicted drug indications.

Updates on drug-target network; facilitating polypharmacology and data integration by growth of DrugBank database

Network pharmacology elucidates the relationship between drugs and targets. As the identified targets for each drug increases, the corresponding drug-target network (DTN) evolves from solely reflection of the pharmaceutical industry trend to a portrait of polypharmacology. The aim of this study was to evaluate the potentials of DrugBank database in advancing systems pharmacology. We constructed and analyzed DTN from drugs and targets associations in the DrugBank 4.0 database. Our results showed that in bipartite DTN, increased ratio of identified targets for drugs augmented density and connectivity of drugs and targets and decreased modular structure. To clear up the details in the network structure, the DTNs were projected into two networks namely, drug similarity network (DSN) and target similarity network (TSN). In DSN, various classes of Food and Drug Administration-approved drugs with distinct therapeutic categories were linked together based on shared targets. Projected TSN also showed complexity because of promiscuity of the drugs. By including investigational drugs that are currently being tested in clinical trials, the networks manifested more connectivity and pictured the upcoming pharmacological space in the future years. Diverse biological processes and protein-protein interactions were manipulated by new drugs, which can extend possible target combinations. We conclude that network-based organization of DrugBank 4.0 data not only reveals the potential for repurposing of existing drugs, also allows generating novel predictions about drugs off-targets, drug-drug interactions and their side effects. Our results also encourage further effort for high-throughput identification of targets to build networks that can be integrated into disease networks.

Detection of composite communities in multiplex biological networks

The detection of community structure is a widely accepted means of investigating the principles governing biological systems. Recent efforts are exploring ways in which multiple data sources can be integrated to generate a more comprehensive model of cellular interactions, leading to the detection of more biologically relevant communities. In this work, we propose a mathematical programming model to cluster multiplex biological networks, i.e. multiple network slices, each with a different interaction type, to determine a single representative partition of composite communities. Our method, known as SimMod, is evaluated through its application to yeast networks of physical, genetic and co-expression interactions. A comparative analysis involving partitions of the individual networks, partitions of aggregated networks and partitions generated by similar methods from the literature highlights the ability of SimMod to identify functionally enriched modules. It is further shown that SimMod offers enhanced results when compared to existing approaches without the need to train on known cellular interactions.

Targets of drugs are generally, and targets of drugs having side effects are specifically good spreaders of human interactome perturbations

Network-based methods are playing an increasingly important role in drug design. Our main question in this paper was whether the efficiency of drug target proteins to spread perturbations in the human interactome is larger if the binding drugs have side effects, as compared to those which have no reported side effects. Our results showed that in general, drug targets were better spreaders of perturbations than non-target proteins, and in particular, targets of drugs with side effects were also better spreaders of perturbations than targets of drugs having no reported side effects in human protein-protein interaction networks. Colorectal cancer-related proteins were good spreaders and had a high centrality, while type 2 diabetes-related proteins showed an average spreading efficiency and had an average centrality in the human interactome. Moreover, the interactome-distance between drug targets and disease-related proteins was higher in diabetes than in colorectal cancer. Our results may help a better understanding of the network position and dynamics of drug targets and disease-related proteins, and may contribute to develop additional, network-based tests to increase the potential safety of drug candidates.

Systematic drug repositioning for a wide range of diseases with integrative analyses of phenotypic and molecular data

Drug repositioning, or the application of known drugs to new indications, is a challenging issue in pharmaceutical science. In this study, we developed a new computational method to predict unknown drug indications for systematic drug repositioning in a framework of supervised network inference. We defined a descriptor for each drug-disease pair based on the phenotypic features of drugs (e.g., medicinal effects and side effects) and various molecular features of diseases (e.g., disease-causing genes, diagnostic markers, disease-related pathways, and environmental factors) and constructed a statistical model to predict new drug-disease associations for a wide range of diseases in the International Classification of Diseases. Our results show that the proposed method outperforms previous methods in terms of accuracy and applicability, and its performance does not depend on drug chemical structure similarity. Finally, we performed a comprehensive prediction of a drug-disease association network consisting of 2349 drugs and 858 diseases and described biologically meaningful examples of newly predicted drug indications for several types of cancers and nonhereditary diseases.

Rectifying cancer drug discovery through network pharmacology

In spite of the expensive preclinical testing, the consistent failure to translate many promising targeted drugs from the laboratory bench to the clinic raises the question of whether the single-pathway drug-discovery strategies offer the correct perspective. As revealed by network biology, cancers harbor robust biological networks that are inherently resistant to changes, such as those induced by drugs with very narrow mechanisms of action. Therefore, network pharmacology strategies, the treatment of cancer by modulating more than one target, are needed. Different promiscuous approaches targeting multiple avenues within cancer-associated networks, such as the pleiotropic natural products, are emerging. Nevertheless, there is a long way before such 'proof-of-concept strategies' can be successfully applied in the clinical setting. This article provides a perspective on the current challenges in drug discovery, the reasons for high failure rates and how network pharmacology can aid the successful design of agents against cancer.

From proteomes to complexomes in the era of systems biology

Protein complexes carry out almost the entire signaling and functional processes in the cell. The protein complex complement of a cell, and its network of complex-complex interactions, is referred to here as the complexome. Computational methods to predict protein complexes from proteomics data, resulting in network representations of complexomes, have recently being developed. In addition, key advances have been made toward understanding the network and structural organization of complexomes. We review these bioinformatics advances, and their discovery-potential, as well as the merits of integrating proteomics data with emerging methods in systems biology to study protein complex signaling. It is envisioned that improved integration of proteomics and systems biology, incorporating the dynamics of protein complexes in space and time, may lead to more predictive models of cell signaling networks for effective modulation.

Spatiotemporal positioning of multipotent modules in diverse biological networks

A biological network exhibits a modular organization. The modular structure dependent on functional module is of great significance in understanding the organization and dynamics of network functions. A huge variety of module identification methods as well as approaches to analyze modularity and dynamics of the inter- and intra-module interactions have emerged recently, but they are facing unexpected challenges in further practical applications. Here, we discuss recent progress in understanding how such a modular network can be deconstructed spatiotemporally. We focus particularly on elucidating how various deciphering mechanisms operate to ensure precise module identification and assembly. In this case, a system-level understanding of the entire mechanism of module construction is within reach, with important implications for reasonable perspectives in both constructing a modular analysis framework and deconstructing different modular hierarchical structures.

Structure and dynamics of molecular networks: a novel paradigm of drug discovery: a comprehensive review

Despite considerable progress in genome- and proteome-based high-throughput screening methods and in rational drug design, the increase in approved drugs in the past decade did not match the increase of drug development costs. Network description and analysis not only give a systems-level understanding of drug action and disease complexity, but can also help to improve the efficiency of drug design. We give a comprehensive assessment of the analytical tools of network topology and dynamics. The state-of-the-art use of chemical similarity, protein structure, protein-protein interaction, signaling, genetic interaction and metabolic networks in the discovery of drug targets is summarized. We propose that network targeting follows two basic strategies. The "central hit strategy" selectively targets central nodes/edges of the flexible networks of infectious agents or cancer cells to kill them. The "network influence strategy" works against other diseases, where an efficient reconfiguration of rigid networks needs to be achieved by targeting the neighbors of central nodes/edges. It is shown how network techniques can help in the identification of single-target, edgetic, multi-target and allo-network drug target candidates. We review the recent boom in network methods helping hit identification, lead selection optimizing drug efficacy, as well as minimizing side-effects and drug toxicity. Successful network-based drug development strategies are shown through the examples of infections, cancer, metabolic diseases, neurodegenerative diseases and aging. Summarizing >1200 references we suggest an optimized protocol of network-aided drug development, and provide a list of systems-level hallmarks of drug quality. Finally, we highlight network-related drug development trends helping to achieve these hallmarks by a cohesive, global approach.

Strategies for molecular classification of asthma using bipartite network analysis of cytokine expression

Asthma is a chronic inflammatory disease of the airways that leads to various degrees of recurrent respiratory symptoms affecting patients globally. Specific subgroups of asthma patients have severe disease leading to increased healthcare costs and socioeconomic burden. Despite the overwhelming prevalence of the asthma, there are limitations in predicting response to therapy and identifying patients who are at increased risk of morbidity. This syndrome presents with common clinical signs and symptoms; however, awareness of subgroups of asthma patients with distinct characteristics has surfaced in recent years. Investigators attempt to describe the phenotypes of asthma to ultimately assist with diagnostic and therapeutic applications. Approaches to asthma phenotyping are multifold; however, it can be partitioned into 2 essential groups, clinical phenotyping and molecular phenotyping. Innovative techniques such as bipartite network analysis and visual analytics introduce a new dimension of data analysis to identify underlying mechanistic pathways.

Disruption of protein complexes

Protein complexes are a cornerstone of many biological processes and, together, they form various types of molecular machinery that perform a vast array of biological functions. Different complexes perform different functions and, the same complex can perform very different functions that depend on a variety of factors. Thus disruption of protein complexes can be lethal to an organism. It is interesting to identify a minimal set of proteins whose removal would lead to a massive disruption of protein complexes and, to understand the biological properties of these proteins. A method is presented for identifying a minimum number of proteins from a given set of complexes so that a maximum number of these complexes are disrupted when these proteins are removed. The method is based on spectral bipartitioning. This method is applied to yeast protein complexes. The identified proteins participate in a large number of biological processes and functional modules. A large proportion of them are essential proteins. Moreover, removing these identified proteins causes a large number of the yeast protein complexes to break into two fragments of nearly equal size, which minimizes the chance of either fragment being functional. The method is also superior in these aspects to alternative methods based on proteins with high connection degree, proteins whose neighbors have high average degree, and proteins that connect to lots of proteins of high connection degree. Our spectral bipartitioning method is able to efficiently identify a biologically meaningful minimal set of proteins whose removal causes a massive disruption of protein complexes in an organism.

Benchmarking human protein complexes to investigate drug-related systems and evaluate predicted protein complexes

Protein complexes are key entities to perform cellular functions. Human diseases are also revealed to associate with some specific human protein complexes. In fact, human protein complexes are widely used for protein function annotation, inference of human protein interactome, disease gene prediction, and so on. Therefore, it is highly desired to build an up-to-date catalogue of human complexes to support the research in these applications. Protein complexes from different databases are as expected to be highly redundant. In this paper, we designed a set of concise operations to compile these redundant human complexes and built a comprehensive catalogue called CHPC2012 (Catalogue of Human Protein Complexes). CHPC2012 achieves a higher coverage for proteins and protein complexes than those individual databases. It is also verified to be a set of complexes with high quality as its co-complex protein associations have a high overlap with protein-protein interactions (PPI) in various existing PPI databases. We demonstrated two distinct applications of CHPC2012, that is, investigating the relationship between protein complexes and drug-related systems and evaluating the quality of predicted protein complexes. In particular, CHPC2012 provides more insights into drug development. For instance, proteins involved in multiple complexes (the overlapping proteins) are potential drug targets; the drug-complex network is utilized to investigate multi-target drugs and drug-drug interactions; and the disease-specific complex-drug networks will provide new clues for drug repositioning. With this up-to-date reference set of human protein complexes, we believe that the CHPC2012 catalogue is able to enhance the studies for protein interactions, protein functions, human diseases, drugs, and related fields of research. CHPC2012 complexes can be downloaded from http://www1.i2r.a-star.edu.sg/xlli/CHPC2012/CHPC2012.htm.

Characterizing the network of drugs and their affected metabolic subpathways

A fundamental issue in biology and medicine is illustration of the overall drug impact which is always the consequence of changes in local regions of metabolic pathways (subpathways). To gain insights into the global relationship between drugs and their affected metabolic subpathways, we constructed a drug-metabolic subpathway network (DRSN). This network included 3925 significant drug-metabolic subpathway associations representing drug dual effects. Through analyses based on network biology, we found that if drugs were linked to the same subpathways in the DRSN, they tended to share the same indications and side effects. Furthermore, if drugs shared more subpathways, they tended to share more side effects. We then calculated the association score by integrating drug-affected subpathways and disease-related subpathways to quantify the extent of the associations between each drug class and disease class. The results showed some close drug-disease associations such as sex hormone drugs and cancer suggesting drug dual effects. Surprisingly, most drugs displayed close associations with their side effects rather than their indications. To further investigate the mechanism of drug dual effects, we classified all the subpathways in the DRSN into therapeutic and non-therapeutic subpathways representing drug therapeutic effects and side effects. Compared to drug side effects, the therapeutic effects tended to work through tissue-specific genes and these genes tend to be expressed in the adrenal gland, liver and kidney; while drug side effects always occurred in the liver, bone marrow and trachea. Taken together, the DRSN could provide great insights into understanding the global relationship between drugs and metabolic subpathways.