Browse
Submit Data
Databases
API
Help

Dataset Information

25 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Generating weighted and thresholded gene coexpression networks using signed distance correlation

ABSTRACT: Even within well-studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes or proteins, using a network of gene coexpression data that includes functional annotations. Signed distance correlation has proved useful for the construction of unweighted gene coexpression networks. However, transforming correlation values into unweighted networks may lead to a loss of important biological information related to the intensity of the correlation. Here we introduce a principled method to construct weighted gene coexpression networks using signed distance correlation. These networks contain weighted edges only between those pairs of genes whose correlation value is higher than a given threshold. We analyse data from different organisms and find that networks generated with our method based on signed distance correlation are more stable and capture more biological information compared to networks obtained from Pearson correlation. Moreover, we show that signed distance correlation networks capture more biological information than unweighted networks based on the same metric. While we use biological data sets to illustrate the method, the approach is general and can be used to construct networks in other domains. Code and data are available on https://github.com/javier-pardodiaz/sdcorGCN.

SUBMITTER: Pardo-Diaz J

PROVIDER: S-EPMC7613200 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Robust gene coexpression networks using signed distance correlation.

Project description:MotivationEven within well studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes/proteins, using a network of gene coexpression data that includes functional annotations. However, the lack of trustworthy functional annotations can impede the validation of such networks. Hence, there is a need for a principled method to construct gene coexpression networks that capture biological information and are structurally stable even in the absence of functional information.ResultsWe introduce the concept of signed distance correlation as a measure of dependency between two variables, and apply it to generate gene coexpression networks. Distance correlation offers a more intuitive approach to network construction than commonly used methods such as Pearson correlation and mutual information. We propose a framework to generate self-consistent networks using signed distance correlation purely from gene expression data, with no additional information. We analyse data from three different organisms to illustrate how networks generated with our method are more stable and capture more biological information compared to networks obtained from Pearson correlation or mutual information.Supplementary informationSupplementary Information and code are available at Bioinformatics and https://github.com/javier-pardodiaz/sdcorGCN online.

| S-EPMC8557847 | biostudies-literature

The asymptotic distribution of modularity in weighted signed networks.

Project description:Modularity is a popular metric for quantifying the degree of community structure within a network. The distribution of the largest eigenvalue of a network's edge weight or adjacency matrix is well studied and is frequently used as a substitute for modularity when performing statistical inference. However, we show that the largest eigenvalue and modularity are asymptotically uncorrelated, which suggests the need for inference directly on modularity itself when the network size is large. To this end, we derive the asymptotic distributions of modularity in the case where the network's edge weight matrix belongs to the Gaussian orthogonal ensemble, and study the statistical power of the corresponding test for community structure under some alternative models. We empirically explore universality extensions of the limiting distribution and demonstrate the accuracy of these asymptotic distributions through Type I error simulations. We also compare the empirical powers of the modularity based tests with some existing methods. Our method is then used to test for the presence of community structure in two real data applications.

| S-EPMC8300091 | biostudies-literature

Generalization of clustering coefficients to signed correlation networks.

Project description:The recent interest in network analysis applications in personality psychology and psychopathology has put forward new methodological challenges. Personality and psychopathology networks are typically based on correlation matrices and therefore include both positive and negative edge signs. However, some applications of network analysis disregard negative edges, such as computing clustering coefficients. In this contribution, we illustrate the importance of the distinction between positive and negative edges in networks based on correlation matrices. The clustering coefficient is generalized to signed correlation networks: three new indices are introduced that take edge signs into account, each derived from an existing and widely used formula. The performances of the new indices are illustrated and compared with the performances of the unsigned indices, both on a signed simulated network and on a signed network based on actual personality psychology data. The results show that the new indices are more resistant to sample variations in correlation networks and therefore have higher convergence compared with the unsigned indices both in simulated networks and with real data.

| S-EPMC3931641 | biostudies-literature

Gene expression data analysis using Hellinger correlation in weighted gene co-expression networks (WGCNA).

Project description:Weighted gene co-expression network analysis (WGCNA) is used to detect clusters with highly correlated genes. Measurements of correlation most typically rely on linear relationships. However, a linear relationship does not always model pairwise functional-related dependence between genes. In this paper, we first compared 6 different correlation methods in their ability to capture complex dependence between genes in three different tissues. Next, we compared their gene-pairwise coefficient results and corresponding WGCNA results. Finally, we applied a recently proposed correlation method, Hellinger correlation, as a more sensitive correlation measurement in WGCNA. To test this method, we constructed gene networks containing co-expression gene modules from RNA-seq data of human frontal cortex from Alzheimer's disease patients. To test the generality, we also used a microarray data set from human frontal cortex, single cell RNA-seq data from human prefrontal cortex, RNA-seq data from human temporal cortex, and GTEx data from heart. The Hellinger correlation method captures essentially similar results as other linear correlations in WGCNA, but provides additional new functional relationships as exemplified by uncovering a link between inflammation and mitochondria function. We validated the network constructed with the microarray and single cell sequencing data sets and a RNA-seq dataset of temporal cortex. We observed that this new correlation method enables the detection of non-linear biologically meaningful relationships among genes robustly and provides a complementary new approach to WGCNA. Thus, the application of Hellinger correlation to WGCNA provides a more flexible correlation approach to modelling networks in gene expression analysis that uncovers novel network relationships.

| S-EPMC9307959 | biostudies-literature

Do-it-yourself networks: a novel method of generating weighted networks.

Project description:Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating unweighted networks. In this paper, we present a framework for generating weighted networks that satisfy user-defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithms in the literature. We use a general example of ecological species dispersal to illustrate the method and provide open-source code for academic purposes.

| S-EPMC5717683 | biostudies-literature

Inferring nonlinear gene regulatory networks from gene expression data based on distance correlation.

Project description:Nonlinear dependence is general in regulation mechanism of gene regulatory networks (GRNs). It is vital to properly measure or test nonlinear dependence from real data for reconstructing GRNs and understanding the complex regulatory mechanisms within the cellular system. A recently developed measurement called the distance correlation (DC) has been shown powerful and computationally effective in nonlinear dependence for many situations. In this work, we incorporate the DC into inferring GRNs from the gene expression data without any underling distribution assumptions. We propose three DC-based GRNs inference algorithms: CLR-DC, MRNET-DC and REL-DC, and then compare them with the mutual information (MI)-based algorithms by analyzing two simulated data: benchmark GRNs from the DREAM challenge and GRNs generated by SynTReN network generator, and an experimentally determined SOS DNA repair network in Escherichia coli. According to both the receiver operator characteristic (ROC) curve and the precision-recall (PR) curve, our proposed algorithms significantly outperform the MI-based algorithms in GRNs inference.

| S-EPMC3925093 | biostudies-literature

Identification of Key Genes in Severe Burns by Using Weighted Gene Coexpression Network Analysis.

Project description:The aims of this work were to explore the use of weighted gene coexpression network analysis (WGCNA) for identifying the key genes in severe burns and to provide a reference for finding therapeutic targets for burn wounds. The GSE8056 dataset was selected from the gene expression database of the US National Center for Biotechnology Information for analysis, and a WGCNA network was constructed to screen differentially expressed genes (DEGs). Gene Ontology and pathway enrichment of DGEs were analyzed, and protein interaction network was constructed. A burn mouse model was constructed, and the burn tissue was taken to identify the expression levels of differentially expressed genes. The results showed that the optimal soft threshold for constructing the WGCNA network was 9. 10 coexpressed gene modules were identified, among which the green, brown, and gray modules had the largest number of burn-related genes. The DEGs were mainly related to immune cell activation, inflammatory response, and immune response, and they were enriched in PD-1/PD-L1, Toll-like receptor, p53, and nuclear factor-kappa B (NF-κB) signaling pathways. 5 DEGs were screened and identified, namely, Jun protooncogene (JUN), signal transducer and activator of transcription 1 (STAT1), BCL2 apoptosis regulator (Bcl2), matrix metallopeptidase 9 (MMP9), and Toll-like receptor 2 (TLR2). Compared with skin tissue of normal mouse, the messenger ribose nucleic acid (mRNA) and protein expression levels (PEL) of STAT1 and Bcl2 in burn tissue were greatly decreased, while those of JUN, MMP9, and TLR2 were increased obviously (p < 0.05). In conclusion, STAT1, Bcl2, JUN, MMP9, and TLR2 can be potential biological targets for the treatment of severe burn wounds.

| S-EPMC9256319 | biostudies-literature

Inferring directional relationships in microbial communities using signed Bayesian networks.

Project description:BackgroundMicrobe-microbe and host-microbe interactions in a microbiome play a vital role in both health and disease. However, the structure of the microbial community and the colonization patterns are highly complex to infer even under controlled wet laboratory conditions. In this study, we investigate what information, if any, can be provided by a Bayesian Network (BN) about a microbial community. Unlike the previously proposed Co-occurrence Networks (CoNs), BNs are based on conditional dependencies and can help in revealing complex associations.ResultsIn this paper, we propose a way of combining a BN and a CoN to construct a signed Bayesian Network (sBN). We report a surprising association between directed edges in signed BNs and known colonization orders.ConclusionsBNs are powerful tools for community analysis and extracting influences and colonization patterns, even though the analysis only uses an abundance matrix with no temporal information. We conclude that directed edges in sBNs when combined with negative correlations are consistent with and strongly suggestive of colonization order.

| S-EPMC7751116 | biostudies-literature

Meshless Monte Carlo radiation transfer method for curved geometries using signed distance functions.

Project description:SignificanceMonte Carlo radiation transfer (MCRT) is the gold standard for modeling light transport in turbid media. Typical MCRT models use voxels or meshes to approximate experimental geometry. A voxel-based geometry does not allow for the precise modeling of smooth curved surfaces, such as may be found in biological systems or food and drink packaging. Mesh-based geometry allows arbitrary complex shapes with smooth curved surfaces to be modeled. However, mesh-based models also suffer from issues such as the computational cost of generating meshes and inaccuracies in how meshes handle reflections and refractions.AimWe present our algorithm, which we term signedMCRT (sMCRT), a geometry-based method that uses signed distance functions (SDF) to represent the geometry of the model. SDFs are capable of modeling smooth curved surfaces precisely while also modeling complex geometries.ApproachWe show that using SDFs to represent the problem's geometry is more precise than voxel and mesh-based methods.ResultssMCRT is validated against theoretical expressions, and voxel and mesh-based MCRT codes. We show that sMCRT can precisely model arbitrary complex geometries such as microvascular vessel network using SDFs. In comparison with the current state-of-the-art in MCRT methods specifically for curved surfaces, sMCRT is more precise for cases where the geometry can be defined using combinations of shapes.ConclusionsWe believe that SDF-based MCRT models are a complementary method to voxel and mesh models in terms of being able to model complex geometries and accurately treat curved surfaces, with a focus on precise simulation of reflections and refractions. sMCRT is publicly available at https://github.com/lewisfish/signedMCRT.

| S-EPMC9350858 | biostudies-literature

Generating properly weighted ensemble of conformations of proteins from sparse or indirect distance constraints.

Project description:Inferring three-dimensional structural information of biomacromolecules such as proteins from limited experimental data is an important and challenging task. Nuclear Overhauser effect measurements based on nucleic magnetic resonance, disulfide linking, and electron paramagnetic resonance labeling studies can all provide useful partial distance constraint characteristic of the conformations of proteins. In this study, we describe a general approach for reconstructing conformations of biomolecules that are consistent with given distance constraints. Such constraints can be in the form of upper bounds and lower bounds of distances between residue pairs, contact maps based on specific contact distance cutoff values, or indirect distance constraints such as experimental phi-value measurement. Our approach is based on the framework of sequential Monte Carlo method, a chain growth-based method. We have developed a novel growth potential function to guide the generation of conformations that satisfy given distance constraints. This potential function incorporates not only the distance information of current residue during growth but also the distance information of future residues by introducing global distance upper bounds between residue pairs and the placement of reference points. To obtain protein conformations from indirect distance constraints in the form of experimental phi-values, we first generate properly weighted contact maps satisfying phi-value constraints, we then generate conformations from these contact maps. We show that our approach can faithfully generate conformations that satisfy the given constraints, which approach the native structures when distance constraints for all residue pairs are given.

| S-EPMC2640457 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data