Finding Gene Regulatory Networks in Psoriasis: Application of a Tree-Based Machine Learning Approach.
Ontology highlight
ABSTRACT:
SUBMITTER: Deng J
PROVIDER: S-EPMC9301015 | biostudies-literature | 2022
REPOSITORIES: biostudies-literature
Publications
Finding Gene Regulatory Networks in Psoriasis: Application of a Tree-Based Machine Learning Approach.
Deng Jingwen J Schieler Carlotta C Borghans José A M JAM Lu Chuanjian C Pandit Aridaman A
Frontiers in immunology 20220707
Psoriasis is a chronic inflammatory skin disorder. Although it has been studied extensively, the molecular mechanisms driving the disease remain unclear. In this study, we utilized a tree-based machine learning approach to explore the gene regulatory networks underlying psoriasis. We then validated the regulators and their networks in an independent cohort. We identified some key regulators of psoriasis, which are candidates to serve as potential drug targets and disease severity biomarkers. Acc ...[more]
Similar Datasets
Project description:Gene regulatory networks (GRNs) provide a representation of relationships between regulators and their target genes. Several methods for GRN inference, both unsupervised and supervised, have been developed to date. Because regulatory relationships consistently reprogram in diverse tissues or under different conditions, GRNs inferred without specific biological contexts are of limited applicability. In this report, a machine learning approach is presented to predict GRNs specific to developing Arabidopsis thaliana embryos. We developed the Beacon GRN inference tool to predict GRNs occurring during seed development in Arabidopsis based on a support vector machine (SVM) model. We developed both global and local inference models and compared their performance, demonstrating that local models are generally superior for our application. Using both the expression levels of the genes expressed in developing embryos and prior known regulatory relationships, GRNs were predicted for specific embryonic developmental stages. The targets that are strongly positively correlated with their regulators are mostly expressed at the beginning of seed development. Potential direct targets were identified based on a match between the promoter regions of these inferred targets and the cis elements recognized by specific regulators. Our analysis also provides evidence for previously unknown inhibitory effects of three positive regulators of gene expression. The Beacon GRN inference tool provides a valuable model system for context-specific GRN inference and is freely available at https://github.com/BeaconProjectAtVirginiaTech/beacon_network_inference.git.
| S-EPMC5179539 | biostudies-literature
Project description:Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks, classification of networks into super-families, and protein function annotation. However, identification of large network motifs is a challenging task as it involves the graph isomorphism problem. Although this problem has been studied extensively in the literature using different computational approaches, still there is a lot of scope for improvement. Motivated by the challenges involved in this field, an efficient and scalable network motif finding algorithm using a dynamic expansion tree is proposed. The novelty of the proposed algorithm is that it avoids computationally expensive graph isomorphism tests and overcomes the space limitation of the static expansion tree (SET) which makes it enable to find large motifs. In this algorithm, the embeddings corresponding to a child node of the expansion tree are obtained from the embeddings of a parent node, either by adding a vertex or by adding an edge. This process does not involve any graph isomorphism check. The time complexity of vertex addition and edge addition are O(n) and O(1), respectively. The growth of a dynamic expansion tree (DET) depends on the availability of patterns in the target network. Pruning of branches in the DET significantly reduces the space requirement of the SET. The proposed algorithm has been tested on a protein-protein interaction network obtained from the MINT database. The proposed algorithm is able to identify large network motifs faster than most of the existing motif finding algorithms.
| S-EPMC6526900 | biostudies-literature
Project description:Deregulation of cell signaling pathways plays a crucial role in the development of tumors. The identification of such pathways requires effective analysis tools that facilitate the interpretation of expression differences. Here, we present a novel and highly efficient method for identifying deregulated subnetworks in a regulatory network. Given a score for each node that measures the degree of deregulation of the corresponding gene or protein, the algorithm computes the heaviest connected subnetwork of a specified size reachable from a designated root node. This root node can be interpreted as a molecular key player responsible for the observed deregulation. To demonstrate the potential of our approach, we analyzed three gene expression data sets. In one scenario, we compared expression profiles of non-malignant primary mammary epithelial cells derived from BRCA1 mutation carriers and of epithelial cells without BRCA1 mutation. Our results suggest that oxidative stress plays an important role in epithelial cells of BRCA1 mutation carriers and that the activation of stress proteins may result in avoidance of apoptosis leading to an increased overall survival of cells with genetic alterations. In summary, our approach opens new avenues for the elucidation of pathogenic mechanisms and for the detection of molecular key players.
| S-EPMC3315310 | biostudies-literature
Project description:Inference of biological network structures is often performed on high-dimensional data, yet is hindered by the limited sample size of high throughput "omics" data typically available. To overcome this challenge, often referred to as the "small n, large p problem," we exploit known organizing principles of biological networks that are sparse, modular, and likely share a large portion of their underlying architecture. We present SHINE-Structure Learning for Hierarchical Networks-a framework for defining data-driven structural constraints and incorporating a shared learning paradigm for efficiently learning multiple Markov networks from high-dimensional data at large p/n ratios not previously feasible. We evaluated SHINE on Pan-Cancer data comprising 23 tumor types, and found that learned tumor-specific networks exhibit expected graph properties of real biological networks, recapture previously validated interactions, and recapitulate findings in literature. Application of SHINE to the analysis of subtype-specific breast cancer networks identified key genes and biological processes for tumor maintenance and survival as well as potential therapeutic targets for modulating known breast cancer disease genes.
| S-EPMC10231840 | biostudies-literature
Project description:Timely and efficacious antibiotic treatment depends on precise and quick in silico antimicrobial-resistance predictions. Limited treatment choices due to antimicrobial resistance (AMR) highlight the necessity to optimize the available diagnostics. AMR can be explicitly anticipated on the basis of genome sequence. In this study, we used transcriptomes of 410 multidrug-resistant isolates of Pseudomonas aeruginosa. We trained 10 machine learning (ML) classifiers on the basis of data on gene expression (GEXP) information and generated predictive models for meropenem, ciprofloxacin, and ceftazidime drugs. Among all the used ML models, four models showed high F1-score, accuracy, precision, and specificity compared with the other models. However, RandomForestClassifier showed a moderate F1-score (0.6), precision (0.61), and specificity (0.625) for ciprofloxacin. In the case of ceftazidime, RidgeClassifier performed well and showed F1-score (0.652), precision (0.654), and specificity (0.652) values. For meropenem, KNeighborsClassifier exhibited moderate F1-score (0.629), precision (0.629), and specificity (0.629). Among these three antibiotics, GEXP data on meropenem and ceftazidime improved diagnostic performance. The findings will pave the way for the establishment of a resistance profiling tool that can predict AMR on the basis of transcriptomic markers.
| S-EPMC9686960 | biostudies-literature
Project description:SummaryDesigning interventions to control gene regulation necessitates modeling a gene regulatory network by a causal graph. Currently, large-scale gene expression datasets from different conditions, cell types, disease states, and developmental time points are being collected. However, application of classical causal inference algorithms to infer gene regulatory networks based on such data is still challenging, requiring high sample sizes and computational resources. Here, we describe an algorithm that efficiently learns the differences in gene regulatory mechanisms between different conditions. Our difference causal inference (DCI) algorithm infers changes (i.e. edges that appeared, disappeared, or changed weight) between two causal graphs given gene expression data from the two conditions. This algorithm is efficient in its use of samples and computation since it infers the differences between causal graphs directly without estimating each possibly large causal graph separately. We provide a user-friendly Python implementation of DCI and also enable the user to learn the most robust difference causal graph across different tuning parameters via stability selection. Finally, we show how to apply DCI to single-cell RNA-seq data from different conditions and cell states, and we also validate our algorithm by predicting the effects of interventions.Availability and implementationPython package freely available at http://uhlerlab.github.io/causaldag/dci.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC9991896 | biostudies-literature
Project description:The angiosperm seed represents a critical evolutionary breakthrough that has been shown to propel the reproductive success and radiation of flowering plants. Seeds promote the rapid diversification of angiosperms by establishing postzygotic reproductive barriers, such as hybrid seed inviability. While prezygotic barriers to reproduction tend to be transient, postzygotic barriers are often permanent and therefore can play a pivotal role in facilitating speciation. This property of the angiosperm seed is exemplified in the Mimulus genus. In order to further the understanding of the gene regulatory mechanisms important in the Mimulus seed, we performed gene regulatory network (GRN) inference analysis by using time-series RNA-seq data from developing hybrid seeds from a viable cross between Mimulus guttatus and Mimulus pardalis. GRN inference has the capacity to identify active regulatory mechanisms in a sample and highlight genes of potential biological importance. In our case, GRN inference also provided the opportunity to uncover active regulatory relationships and generate a reference set of putative gene regulations. We deployed two GRN inference algorithms-RTP-STAR and KBoost-on three different subsets of our transcriptomic dataset. While the two algorithms yielded GRNs with different regulations and topologies when working with the same data subset, there was still significant overlap in the specific gene regulations they inferred, and they both identified potential novel regulatory mechanisms that warrant further investigation.
| S-EPMC11644258 | biostudies-literature
Project description:MotivationOscillations lie at the core of many biological processes, from the cell cycle, to circadian oscillations and developmental processes. Time-keeping mechanisms are essential to enable organisms to adapt to varying conditions in environmental cycles, from day/night to seasonal. Transcriptional regulatory networks are one of the mechanisms behind these biological oscillations. However, while identifying cyclically expressed genes from time series measurements is relatively easy, determining the structure of the interaction network underpinning the oscillation is a far more challenging problem.ResultsHere, we explicitly leverage the oscillatory nature of the transcriptional signals and present a method for reconstructing network interactions tailored to this special but important class of genetic circuits. Our method is based on projecting the signal onto a set of oscillatory basis functions using a Discrete Fourier Transform. We build a Bayesian Hierarchical model within a frequency domain linear model in order to enforce sparsity and incorporate prior knowledge about the network structure. Experiments on real and simulated data show that the method can lead to substantial improvements over competing approaches if the oscillatory assumption is met, and remains competitive also in cases it is not.AvailabilityDSS, experiment scripts and data are available at http://homepages.inf.ed.ac.uk/gsanguin/DSS.zip.Contactd.trejo-banos@sms.ed.ac.ukSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC4817140 | biostudies-literature
Project description:BackgroundVarious computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs). As a logical model, probabilistic Boolean networks (PBNs) consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n) or O(nN2n) for a sparse matrix.ResultsThis paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN). An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n), where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model.ConclusionsStochastic Boolean networks (SBNs) are proposed as an efficient approach to modelling gene regulatory networks (GRNs). The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.
| S-EPMC3532238 | biostudies-literature
Project description:In agricultural robotics, a unique challenge exists in the automated planting of bulbous plants: the estimation of the bulb's growth direction. To date, no existing work addresses this challenge. Therefore, we propose the first robotic vision framework for the estimation of a plant bulb's growth direction. The framework takes as input three x-ray images of the bulb and extracts shape, edge, and texture features from each image. These features are then fed into a machine learning regression algorithm in order to predict the 2D projection of the bulb's growth direction. Using the x-ray system's geometry, these 2D estimates are then mapped to the 3D world coordinate space, where a filtering on the estimate's variance is used to determine whether the estimate is reliable. We applied our algorithm on 27,200 x-ray simulations from T. Apeldoorn bulbs on a standard desktop workstation. Results indicate that our machine learning framework is fast enough to meet industry standards (<0.1 seconds per bulb) while providing acceptable accuracy (e.g. error < 30° in 98.40% of cases using an artificial 3-layer neural network). The high success rates of the proposed framework indicate that it is worthwhile to proceed with the development and testing of a physical prototype of a robotic bulb planting system.
| S-EPMC6971015 | biostudies-literature