A scale of functional divergence for yeast duplicated genes revealed from analysis of the protein-protein interaction network

BACKGROUND: Studying the evolution of the function of duplicated genes usually implies an estimation of the extent of functional conservation/divergence between duplicates from comparison of actual sequences. This only reveals the possible molecular function of genes without taking into account their cellular function(s). We took into consideration this latter dimension of gene function to approach the functional evolution of duplicated genes by analyzing the protein-protein interaction network in which their products are involved. For this, we derived a functional classification of the proteins using PRODISTIN, a bioinformatics method allowing comparison of protein function. Our work focused on the duplicated yeast genes, remnants of an ancient whole-genome duplication. RESULTS: Starting from 4,143 interactions, we analyzed 41 duplicated protein pairs with the PRODISTIN method. We showed that duplicated pairs behaved differently in the classification with respect to their interactors. The different observed behaviors allowed us to propose a functional scale of conservation/divergence for the duplicated genes, based on interaction data. By comparing our results to the functional information carried by GO annotations and sequence comparisons, we showed that the interaction network analysis reveals functional subtleties, which are not discernible by other means. Finally, we interpreted our results in terms of evolutionary scenarios. CONCLUSIONS: Our analysis might provide a new way to analyse the functional evolution of duplicated genes and constitutes the first attempt of protein function evolutionary comparisons based on protein-protein interactions

Identifying communities from multiplex biological networks by randomized optimization of modularity [version 2; referees: 1 approved, 3 approved with reservations]

The identification of communities, or modules, is a common operation in the analysis of large biological networks. The Disease Module Identification DREAM challenge established a framework to evaluate clustering approaches in a biomedical context, by testing the association of communities with GWAS-derived common trait and disease genes. We implemented here several extensions of the MolTi software that detects communities by optimizing multiplex (and monoplex) network modularity. In particular, MolTi now runs a randomized version of the Louvain algorithm, can consider edge and layer weights, and performs recursive clustering. On simulated networks, the randomization procedure clearly improves the detection of communities. On the DREAM challenge benchmark, the results strongly depend on the selected GWAS dataset and enrichment p-value threshold. However, the randomization procedure, as well as the consideration of weighted edges and layers generally increases the number of trait and disease community detected. The new version of MolTi and the scripts used for the DMI DREAM challenge are available at: https://github.com/gilles-didier/MolTi-DREAM

Clust&See: A Cytoscape plugin for the identification, visualization and manipulation of network clusters

International audienceBackground and scope Large networks, such as protein interaction networks, are extremely difficult to analyze as a whole. We developed Clust&See, a Cytoscape plugin dedicated to the identification, visualization and analysis of clusters extracted from such networks. Implementation and performance Clust&See provides the ability to apply three different, recently developed graph clustering algorithms to networks and to visualize: (i) the obtained partition as a quotient graph in which nodes correspond to clusters and (ii) the obtained clusters as their corresponding subnetworks. Importantly, tools for investigating the relationships between clusters and vertices as well as their organization within the whole graph are supplied

Molecular Inverse Comorbidity between Alzheimer’s Disease and Lung Cancer: New Insights from Matrix Factorization

International audienceMatrix factorization (MF) is an established paradigm for large-scale biological data analysis with tremendous potential in computational biology. Here, we challenge MF in depicting the molecular bases of epidemiologically described disease-disease (DD) relationships. As a use case, we focus on the inverse comorbidity association between Alzheimer's disease (AD) and lung cancer (LC), described as a lower than expected probability of developing LC in AD patients. To this day, the molecular mechanisms underlying DD relationships remain poorly explained and their better characterization might offer unprecedented clinical opportunities. To this goal, we extend our previously designed MF-based framework for the molecular characterization of DD relationships. Considering AD-LC inverse comorbidity as a case study, we highlight multiple molecular mechanisms, among which we confirm the involvement of processes related to the immune system and mitochondrial metabolism. We then distinguish mechanisms specific to LC from those shared with other cancers through a pan-cancer analysis. Additionally, new candidate molecular players, such as estrogen receptor (ER), cadherin 1 (CDH1) and histone deacetylase (HDAC), are pinpointed as factors that might underlie the inverse relationship, opening the way to new investigations. Finally, some lung cancer subtype-specific factors are also detected, also suggesting the existence of heterogeneity across patients in the context of inverse comorbidity

The gastrin and cholecystokinin receptors mediated signaling network : a scaffold for data analysis and new hypotheses on regulatory mechanisms

Abstract Background The gastrointestinal peptide hormones cholecystokinin and gastrin exert their biological functions via cholecystokinin receptors CCK1R and CCK2R respectively. Gastrin, a central regulator of gastric acid secretion, is involved in growth and differentiation of gastric and colonic mucosa, and there is evidence that it is pro-carcinogenic. Cholecystokinin is implicated in digestion, appetite control and body weight regulation, and may play a role in several digestive disorders. Results We performed a detailed analysis of the literature reporting experimental evidence on signaling pathways triggered by CCK1R and CCK2R, in order to create a comprehensive map of gastrin and cholecystokinin-mediated intracellular signaling cascades. The resulting signaling map captures 413 reactions involving 530 molecular species, and incorporates the currently available knowledge into one integrated signaling network. The decomposition of the signaling map into sub-networks revealed 18 modules that represent higher-level structures of the signaling map. These modules allow a more compact mapping of intracellular signaling reactions to known cell behavioral outcomes such as proliferation, migration and apoptosis. The integration of large-scale protein-protein interaction data to this literature-based signaling map in combination with topological analyses allowed us to identify 70 proteins able to increase the compactness of the map. These proteins represent experimentally testable hypotheses for gaining new knowledge on gastrin- and cholecystokinin receptor signaling. The CCKR map is freely available both in a downloadable, machine-readable SBML-compatible format and as a web resource through PAYAO ( http://sblab.celldesigner.org:18080/Payao11/bin/ ). Conclusion We have demonstrated how a literature-based CCKR signaling map together with its protein interaction extensions can be analyzed to generate new hypotheses on molecular mechanisms involved in gastrin- and cholecystokinin-mediated regulation of cellular processes

Analyse bioinformatique des interactomes (une approche de la fonction cellulaire des protéines)

AIX-MARSEILLE2-BU Sci.Luminy (130552106) / SudocSudocFranceF

Editorial: Direct and Inverse Comorbidities Between Complex Disorders

International audienc

Universal Multilayer Network Exploration by Random Walk with Restart

The amount and variety of data is increasing drastically for several years. These data are often represented as networks, which are then explored with approaches arising from network theory. Recent years have witnessed the extension of network exploration methods to leverage more complex and richer network frameworks. Random walks, for instance, have been extended to explore multilayer networks. However, current random walk approaches are limited in the combination and heterogeneity of network layers they can handle. New analytical and numerical random walk methods are needed to cope with the increasing diversity and complexity of multilayer networks. We propose here MultiXrank, a Python package that enables Random Walk with Restart (RWR) on any kind of multilayer network with an optimized implementation. This package is supported by a universal mathematical formulation of the RWR. We evaluated MultiXrank with leave-one-out cross-validation and link prediction, and introduced protocols to measure the impact of the addition or removal of multilayer network data on prediction performances. We further measured the sensitivity of MultiXrank to input parameters by in-depth exploration of the parameter space. Finally, we illustrate the versatility of MultiXrank with different use-cases of unsupervised node prioritization and supervised classification in the context of human genetic diseases