Network module identification-A widespread theoretical bias and best practices

NetMix2: A Principled Network Propagation Algorithm for Identifying Altered Subnetworks

A standard paradigm in computational biology is to leverage interaction networks as prior knowledge in analyzing high-throughput biological data, where the data give a score for each vertex in the network. One classical approach is the identification of altered subnetworks, or subnetworks of the interaction network that have both outlier vertex scores and a defined network topology. One class of algorithms for identifying altered subnetworks search for high-scoring subnetworks in subnetwork families with simple topological constraints, such as connected subnetworks, and have sound statistical guarantees. A second class of algorithms employ network propagation-the smoothing of vertex scores over the network using a random walk or diffusion process-and utilize the global structure of the network. However, network propagation algorithms often rely on ad hoc heuristics that lack a rigorous statistical foundation. In this work, we unify the subnetwork family and network propagation approaches by deriving the propagation family, a subnetwork family that approximates the sets of vertices ranked highly by network propagation approaches. We introduce NetMix2, a principled algorithm for identifying altered subnetworks from a wide range of subnetwork families. When using the propagation family, NetMix2 combines the advantages of the subnetwork family and network propagation approaches. NetMix2 outperforms other methods, including network propagation on simulated data, pan-cancer somatic mutation data, and genome-wide association data from multiple human diseases.

TopoFun: a machine learning method to improve the functional similarity of gene co-expression modules

A comprehensive, accurate functional annotation of genes is key to systems-level approaches. As functionally related genes tend to be co-expressed, one possible approach to identify functional modules or supplement existing gene annotations is to analyse gene co-expression. We describe TopoFun, a machine learning method that combines topological and functional information to improve the functional similarity of gene co-expression modules. Using LASSO, we selected topological descriptors that discriminated modules made of functionally related genes and random modules. Using the selected topological descriptors, we performed linear discriminant analysis to construct a topological score that predicted the type of a module, random-like or functional-like. We combined the topological score with a functional similarity score in a fitness function that we used in a genetic algorithm to explore the co-expression network. To illustrate the use of TopoFun, we started from a subset of the Gene Ontology Biological Processes (GO-BPs) and showed that TopoFun efficiently retrieved genes that we omitted, and aggregated a number of novel genes to the initial GO-BP while improving module topology and functional similarity. Using an independent protein-protein interaction database, we confirmed that the novel genes gathered by TopoFun were functionally related to the original gene set.

Construction and characterization of rectal cancer-related lncRNA-mRNA ceRNA network reveals prognostic biomarkers in rectal cancer

Rectal cancer is an important cause of cancer‐related deaths worldwide. In this study, the differentially expressed (DE) lncRNAs/mRNAs were first identified and the correlation level between DE lncRNAs and mRNAs were calculated. The results showed that genes of highly correlated lncRNA‐mRNA pairs presented strong prognosis effects, such as GPM6A, METTL24, SCN7A, HAND2‐AS1 and PDZRN4. Then, the rectal cancer‐related lncRNA‐mRNA network was constructed based on the ceRNA theory. Topological analysis of the network revealed that the network was maintained by hub nodes and a hub subnetwork was constructed, including the hub lncRNA MIR143HG and MBNL1‐SA1. Further analysis indicated that the hub subnetwork was highly related to cancer pathways, such as ‘Focal adhesion’ and ‘Wnt signalling pathway’. Hub subnetwork also had significant prognosis capability. A closed lncRNA‐mRNA module was identified by bilateral network clustering. Genes in modules also showed high prognosis effects. Finally, a core lncRNA‐TF crosstalk network was identified to uncover the crosstalk and regulatory mechanisms of lncRNAs and TFs by integrating ceRNA crosstalks and TF binding affinities. Some core genes, such as MEIS1, GLI3 and HAND2‐AS1 were considered as the key regulators in tumourigenesis. Based on the authors’ comprehensive analysis, all these lncRNA‐mRNA crosstalks provided promising clues for biological prognosis of rectal cancer.

Identification of functional lncRNAs through constructing a lncRNA-associated ceRNA network in myocardial infarction

Myocardial infarction (MI) is a type of coronary heart disease, which refers to the ischemic necrosis of the heart muscle. A large number of studies have discussed the mechanism of MI from the perspective of competing endogenous RNA (ceRNA) network. However, the mechanisms underlying the function of lncRNAs in MI have still not been explained in an explicit manner. Therefore, we constructed a scale-free lncRNA-associated ceRNA network to identify some crucial lncRNAs in MI. Results showed that the given disease genes for MI were involved in the network, the degrees of which were significantly larger than the other nodes of the network. For measuring the network centrality, we then constructed a hub subnetwork. The miRNAs and mRNAs in the hub subnetwork have been validated to function in MI-related biological function. In addition, we identified 2 MI-related functional modules from the lncRNA-associated ceRNA network, which suggested that lncRNA exerted function in local network. Enrichment analysis showed that these functional modules corresponded to some similar and different pathways related to cardiovascular disease. More importantly, 3 MI-related crucial lncRNAs, CTD-3092A11.2, RP5-821D11.7 and CTC-523E23.1 were detected as potential biomarkers, which may be involved in MI-related biological progresses. Our study identified 20 functional lncRNAs based on ceRNA network analysis, which may provide novel diagnosis and therapeutic targets for MI from the ceRNA network perspective.

Boosting GWAS using biological networks: A study on susceptibility to familial breast cancer

Genome-wide association studies (GWAS) explore the genetic causes of complex diseases. However, classical approaches ignore the biological context of the genetic variants and genes under study. To address this shortcoming, one can use biological networks, which model functional relationships, to search for functionally related susceptibility loci. Many such network methods exist, each arising from different mathematical frameworks, pre-processing steps, and assumptions about the network properties of the susceptibility mechanism. Unsurprisingly, this results in disparate solutions. To explore how to exploit these heterogeneous approaches, we selected six network methods and applied them to GENESIS, a nationwide French study on familial breast cancer. First, we verified that network methods recovered more interpretable results than a standard GWAS. We addressed the heterogeneity of their solutions by studying their overlap, computing what we called the consensus. The key gene in this consensus solution was COPS5, a gene related to multiple cancer hallmarks. Another issue we observed was that network methods were unstable, selecting very different genes on different subsamples of GENESIS. Therefore, we proposed a stable consensus solution formed by the 68 genes most consistently selected across multiple subsamples. This solution was also enriched in genes known to be associated with breast cancer susceptibility (BLM, CASP8, CASP10, DNAJC1, FGFR2, MRPS30, and SLC4A7, P-value = 3 × 10-4). The most connected gene was CUL3, a regulator of several genes linked to cancer progression. Lastly, we evaluated the biases of each method and the impact of their parameters on the outcome. In general, network methods preferred highly connected genes, even after random rewirings that stripped the connections of any biological meaning. In conclusion, we present the advantages of network-guided GWAS, characterize their shortcomings, and provide strategies to address them. To compute the consensus networks, implementations of all six methods are available at https://github.com/hclimente/gwas-tools.

DOMINO: a network-based active module identification algorithm with reduced rate of false calls

Algorithms for active module identification (AMI) are central to analysis of omics data. Such algorithms receive a gene network and nodes' activity scores as input and report subnetworks that show significant over‐representation of accrued activity signal (“active modules”), thus representing biological processes that presumably play key roles in the analyzed conditions. Here, we systematically evaluated six popular AMI methods on gene expression and GWAS data. We observed that GO terms enriched in modules detected on the real data were often also enriched on modules found on randomly permuted data. This indicated that AMI methods frequently report modules that are not specific to the biological context measured by the analyzed omics dataset. To tackle this bias, we designed a permutation‐based method that empirically evaluates GO terms reported by AMI methods. We used the method to fashion five novel AMI performance criteria. Last, we developed DOMINO, a novel AMI algorithm, that outperformed the other six algorithms in extensive testing on GE and GWAS data. Software is available at https://github.com/Shamir‐Lab.

NetMix: A Network-Structured Mixture Model for Reduced-Bias Estimation of Altered Subnetworks

A classic problem in computational biology is the identification of altered subnetworks: subnetworks of an interaction network that contain genes/proteins that are differentially expressed, highly mutated, or otherwise aberrant compared with other genes/proteins. Numerous methods have been developed to solve this problem under various assumptions, but the statistical properties of these methods are often unknown. For example, some widely used methods are reported to output very large subnetworks that are difficult to interpret biologically. In this work, we formulate the identification of altered subnetworks as the problem of estimating the parameters of a class of probability distributions that we call the Altered Subset Distribution (ASD). We derive a connection between a popular method, jActiveModules, and the maximum likelihood estimator (MLE) of the ASD. We show that the MLE is statistically biased, explaining the large subnetworks output by jActiveModules. Based on these insights, we introduce NetMix, an algorithm that uses Gaussian mixture models to obtain less biased estimates of the parameters of the ASD. We demonstrate that NetMix outperforms existing methods in identifying altered subnetworks on both simulated and real data, including the identification of differentially expressed genes from both microarray and RNA-seq experiments and the identification of cancer driver genes in somatic mutation data.

Molecular networks in Network Medicine: Development and applications

Network Medicine applies network science approaches to investigate disease pathogenesis. Many different analytical methods have been used to infer relevant molecular networks, including protein-protein interaction networks, correlation-based networks, gene regulatory networks, and Bayesian networks. Network Medicine applies these integrated approaches to Omics Big Data (including genetics, epigenetics, transcriptomics, metabolomics, and proteomics) using computational biology tools and, thereby, has the potential to provide improvements in the diagnosis, prognosis, and treatment of complex diseases. We discuss briefly the types of molecular data that are used in molecular network analyses, survey the analytical methods for inferring molecular networks, and review efforts to validate and visualize molecular networks. Successful applications of molecular network analysis have been reported in pulmonary arterial hypertension, coronary heart disease, diabetes mellitus, chronic lung diseases, and drug development. Important knowledge gaps in Network Medicine include incompleteness of the molecular interactome, challenges in identifying key genes within genetic association regions, and limited applications to human diseases. This article is categorized under: Models of Systems Properties and Processes > Mechanistic Models Translational, Genomic, and Systems Medicine > Translational Medicine Analytical and Computational Methods > Analytical Methods Analytical and Computational Methods > Computational Methods.

Applications of Network Analysis in Biomedicine

The abundance of high-throughput data and technical refinements in graph theories have allowed network analysis to become an effective approach for various medical fields. This chapter introduces co-expression, Bayesian, and regression-based network construction methods, which are the basis of network analysis. Various methods in network topology analysis are explained, along with their unique features and applications in biomedicine. Furthermore, we explain the role of network embedding in reducing the dimensionality of networks and outline several popular algorithms used by researchers today. Current literature has implemented different combinations of topology analysis and network embedding techniques, and we outline several studies in the fields of genetic-based disease prediction, drug-target identification, and multi-level omics integration.

pathfindR: An R Package for Comprehensive Identification of Enriched Pathways in Omics Data Through Active Subnetworks

Pathway analysis is often the first choice for studying the mechanisms underlying a phenotype. However, conventional methods for pathway analysis do not take into account complex protein-protein interaction information, resulting in incomplete conclusions. Previously, numerous approaches that utilize protein-protein interaction information to enhance pathway analysis yielded superior results compared to conventional methods. Hereby, we present pathfindR, another approach exploiting protein-protein interaction information and the first R package for active-subnetwork-oriented pathway enrichment analyses for class comparison omics experiments. Using the list of genes obtained from an omics experiment comparing two groups of samples, pathfindR identifies active subnetworks in a protein-protein interaction network. It then performs pathway enrichment analyses on these identified subnetworks. To further reduce the complexity, it provides functionality for clustering the resulting pathways. Moreover, through a scoring function, the overall activity of each pathway in each sample can be estimated. We illustrate the capabilities of our pathway analysis method on three gene expression datasets and compare our results with those obtained from three popular pathway analysis tools. The results demonstrate that literature-supported disease-related pathways ranked higher in our approach compared to the others. Moreover, pathfindR identified additional pathways relevant to the conditions that were not identified by other tools, including pathways named after the conditions.