A novel Boolean network inference strategy to model early hematopoiesis aging.
Ontology highlight
ABSTRACT:
SUBMITTER: Herault L
PROVIDER: S-EPMC9719905 | biostudies-literature | 2023
REPOSITORIES: biostudies-literature
Publications
A novel Boolean network inference strategy to model early hematopoiesis aging.
Hérault Léonard L Poplineau Mathilde M Duprez Estelle E Remy Élisabeth É
Computational and structural biotechnology journal 20221102
Hematopoietic stem cell (HSC) aging is a multifactorial event leading to changes in HSC properties and functions, which are intrinsically coordinated and affect the early hematopoiesis. To better understand the mechanisms and factors controlling these changes, we developed an original strategy to construct a Boolean model of HSC differentiation. Based on our previous scRNA-seq data, we exhaustively characterized active transcription modules or regulons along the differentiation trajectory and co ...[more]
Similar Datasets
Project description:MotivationThe problem of model inference is of fundamental importance to systems biology. Logical models (e.g. Boolean networks; BNs) represent a computationally attractive approach capable of handling large biological networks. The models are typically inferred from experimental data. However, even with a substantial amount of experimental data supported by some prior knowledge, existing inference methods often focus on a small sample of admissible candidate models only.ResultsWe propose Boolean network sketches as a new formal instrument for the inference of Boolean networks. A sketch integrates (typically partial) knowledge about the network's topology and the update logic (obtained through, e.g. a biological knowledge base or a literature search), as well as further assumptions about the properties of the network's transitions (e.g. the form of its attractor landscape), and additional restrictions on the model dynamics given by the measured experimental data. Our new BNs inference algorithm starts with an 'initial' sketch, which is extended by adding restrictions representing experimental data to a 'data-informed' sketch and subsequently computes all BNs consistent with the data-informed sketch. Our algorithm is based on a symbolic representation and coloured model-checking. Our approach is unique in its ability to cover a broad spectrum of knowledge and efficiently produce a compact representation of all inferred BNs. We evaluate the method on a non-trivial collection of real-world and simulated data.Availability and implementationAll software and data are freely available as a reproducible artefact at https://doi.org/10.5281/zenodo.7688740.
| S-EPMC10122605 | biostudies-literature
Project description:MotivationFrom a systematic perspective, it is crucial to infer and analyze gene regulatory network (GRN) from high-throughput single-cell RNA sequencing data. However, most existing GRN inference methods mainly focus on the network topology, only few of them consider how to explicitly describe the updated logic rules of regulation in GRNs to obtain their dynamics. Moreover, some inference methods also fail to deal with the over-fitting problem caused by the noise in time series data.ResultsIn this article, we propose a novel embedded Boolean threshold network method called LogBTF, which effectively infers GRN by integrating regularized logistic regression and Boolean threshold function. First, the continuous gene expression values are converted into Boolean values and the elastic net regression model is adopted to fit the binarized time series data. Then, the estimated regression coefficients are applied to represent the unknown Boolean threshold function of the candidate Boolean threshold network as the dynamical equations. To overcome the multi-collinearity and over-fitting problems, a new and effective approach is designed to optimize the network topology by adding a perturbation design matrix to the input data and thereafter setting sufficiently small elements of the output coefficient vector to zeros. In addition, the cross-validation procedure is implemented into the Boolean threshold network model framework to strengthen the inference capability. Finally, extensive experiments on one simulated Boolean value dataset, dozens of simulation datasets, and three real single-cell RNA sequencing datasets demonstrate that the LogBTF method can infer GRNs from time series data more accurately than some other alternative methods for GRN inference.Availability and implementationThe source data and code are available at https://github.com/zpliulab/LogBTF.
| S-EPMC10172039 | biostudies-literature
Project description:Biological systems contain a large number of molecules that have diverse interactions. A fruitful path to understanding these systems is to represent them with interaction networks, and then describe flow processes in the network with a dynamic model. Boolean modeling, the simplest discrete dynamic modeling framework for biological networks, has proven its value in recapitulating experimental results and making predictions. A first step and major roadblock to the widespread use of Boolean networks in biology is the laborious network inference and construction process. Here we present a streamlined network inference method that combines the discovery of a parsimonious network structure and the identification of Boolean functions that determine the dynamics of the system. This inference method is based on a causal logic analysis method that associates a logic type (sufficient or necessary) to node-pair relationships (whether promoting or inhibitory). We use the causal logic framework to assimilate indirect information obtained from perturbation experiments and infer relationships that have not yet been documented experimentally. We apply this inference method to a well-studied process of hormone signaling in plants, the signaling underlying abscisic acid (ABA)-induced stomatal closure. Applying the causal logic inference method significantly reduces the manual work typically required for network and Boolean model construction. The inferred model agrees with the manually curated model. We also test this method by re-inferring a network representing epithelial to mesenchymal transition based on a subset of the information that was initially used to construct the model. We find that the inference method performs well for various likely scenarios of inference input information. We conclude that our method is an effective approach toward inference of biological networks and can become an efficient step in the iterative process between experiments and computations.
| S-EPMC9246059 | biostudies-literature
Project description:BackgroundInferring a gene regulatory network from time-series gene expression data in systems biology is a challenging problem. Many methods have been suggested, most of which have a scalability limitation due to the combinatorial cost of searching a regulatory set of genes. In addition, they have focused on the accurate inference of a network structure only. Therefore, there is a pressing need to develop a network inference method to search regulatory genes efficiently and to predict the network dynamics accurately.ResultsIn this study, we employed a Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and propose a novel mutual information-based Boolean network inference (MIBNI) method. Given time-series gene expression data as an input, the method first identifies a set of initial regulatory genes using mutual information-based feature selection, and then improves the dynamics prediction accuracy by iteratively swapping a pair of genes between sets of the selected regulatory genes and the other genes. Through extensive simulations with artificial datasets, MIBNI showed consistently better performance than six well-known existing methods, REVEAL, Best-Fit, RelNet, CST, CLR, and BIBN in terms of both structural and dynamics prediction accuracy. We further tested the proposed method with two real gene expression datasets for an Escherichia coli gene regulatory network and a fission yeast cell cycle network, and also observed better results using MIBNI compared to the six other methods.ConclusionsTaken together, MIBNI is a promising tool for predicting both the structure and the dynamics of a gene regulatory network.
| S-EPMC5298315 | biostudies-literature
Project description:MotivationIt is a challenging problem in systems biology to infer both the network structure and dynamics of a gene regulatory network from steady-state gene expression data. Some methods based on Boolean or differential equation models have been proposed but they were not efficient in inference of large-scale networks. Therefore, it is necessary to develop a method to infer the network structure and dynamics accurately on large-scale networks using steady-state expression.ResultsIn this study, we propose a novel constrained genetic algorithm-based Boolean network inference (CGA-BNI) method where a Boolean canalyzing update rule scheme was employed to capture coarse-grained dynamics. Given steady-state gene expression data as an input, CGA-BNI identifies a set of path consistency-based constraints by comparing the gene expression level between the wild-type and the mutant experiments. It then searches Boolean networks which satisfy the constraints and induce attractors most similar to steady-state expressions. We devised a heuristic mutation operation for faster convergence and implemented a parallel evaluation routine for execution time reduction. Through extensive simulations on the artificial and the real gene expression datasets, CGA-BNI showed better performance than four other existing methods in terms of both structural and dynamics prediction accuracies. Taken together, CGA-BNI is a promising tool to predict both the structure and the dynamics of a gene regulatory network when a highest accuracy is needed at the cost of sacrificing the execution time.Availability and implementationSource code and data are freely available at https://github.com/csclab/CGA-BNI.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC8275338 | biostudies-literature
Project description:Biological pathways are thought to be robust against a variety of internal and external perturbations. Fail-safe mechanisms allow for compensation of perturbations to maintain the characteristic function of a pathway. Pathways can undergo changes during aging, which may lead to changes in their stability. Less stable or less robust pathways may be consequential to or increase the susceptibility of the development of diseases. Among others, NF- κ B signaling is a crucial pathway in the process of aging. The NF- κ B system is involved in the immune response and dealing with various internal and external stresses. Boolean networks as models of biological pathways allow for simulation of signaling behavior. They can help to identify which proposed mechanisms are biologically representative and which ones function but do not mirror physical processes-for instance, changes of signaling pathways during the aging process. Boolean networks can be inferred from time-series of gene expression data. This allows us to get insights into the changes of behavior of pathways such as NF- κ B signaling in aged organisms in comparison to young ones.
| S-EPMC5745451 | biostudies-literature
Project description:Boolean-based method, despite of its simplicity, would be a more attractive approach for inferring a network from high-throughput expression data if its effectiveness has not been limited by high false positive prediction. In this study, we explored factors that could simply be adjusted to improve the accuracy of inferring networks. Our work focused on the analysis of the effects of discretisation methods, biological constraints, and stringency of boolean function assignment on the performance of boolean network, including accuracy, precision, specificity and sensitivity, using three sets of microarray time-series data. The study showed that biological constraints have pivotal influence on the network performance over the other factors. It can reduce the variation in network performance resulting from the arbitrary selection of discretisation methods and stringency settings. We also presented the master boolean network as an approach to establish the unique solution for boolean analysis. The information acquired from the analysis was summarised and deployed as a general guideline for an efficient use of boolean-based method in the network inference. In the end, we provided an example of the use of such a guideline in the study of Arabidopsis circadian clock genetic network from which much interesting biological information can be inferred.
| S-EPMC3260258 | biostudies-literature
Project description:Sepsis is a life-threatening condition driven by the dysregulation of the host immune response to an infection. The complex and interacting mechanisms underlying sepsis remain not fully understood. By integrating prior knowledge from literature using mathematical modelling techniques, we aimed to obtain a deeper mechanistic insight into sepsis pathogenesis and to evaluate promising novel therapeutic targets, with a focus on Toll-like receptor 4 (TLR4)-mediated pathways. A Boolean network of regulatory relationships was developed for key immune components associated with sepsis pathogenesis after TLR4 activation. Perturbation analyses were conducted to identify therapeutic targets associated with organ dysfunction or antibacterial activity. The developed model consisted of 42 nodes and 183 interactions. Perturbation analyses suggest that over-expression of tumour necrosis factor alpha (TNF-α) or inhibition of soluble receptor sTNF-R, tissue factor, and inflammatory cytokines (IFN-γ, IL-12) may lead to a reduced activation of organ dysfunction related endpoints. Over-expression of complement factor C3b and C5b led to an increase in the bacterial clearance related endpoint. We identified that combinatory blockade of IFN-γ and IL-10 may reduce the risk of organ dysfunction. Finally, we found that combining antibiotic treatment with IL-1β targeted therapy may have the potential to decrease thrombosis. In summary, we demonstrate how existing biological knowledge can be effectively integrated using Boolean network analysis for hypothesis generation of potential treatment strategies and characterization of biomarker responses associated with the early inflammatory response in sepsis.
| S-EPMC9649476 | biostudies-literature
Project description:Cellular fates are determined by genes interacting across large, complex biological networks. A critical question is how to identify causal relationships spanning distinct signaling pathways and underlying organismal phenotypes. Here, we address this question by constructing a Boolean model of a well-studied developmental network and analyzing information flows through the system. Depending on environmental signals Caenorhabditis elegans develop normally to sexual maturity or enter a reproductively delayed, developmentally quiescent ‘dauer’ state, progressing to maturity when the environment changes. The developmental network that starts with environmental signal and ends in the dauer/no dauer fate involves genes across 4 signaling pathways including cyclic GMP, Insulin/IGF-1, TGF-β and steroid hormone synthesis. We identified three stable motifs leading to normal development, each composed of genes interacting across the Insulin/IGF-1, TGF-β and steroid hormone synthesis pathways. Three genes known to influence dauer fate, daf-2, daf-7 and hsf-1, acted as driver nodes in the system. Using causal logic analysis, we identified a five gene cyclic subgraph integrating the information flow from environmental signal to dauer fate. Perturbation analysis showed that a multifactorial insulin profile determined the stable motifs the system entered and interacted with daf-12 as the switchpoint driving the dauer/no dauer fate. Our results show that complex organismal systems can be distilled into abstract representations that permit full characterization of the causal relationships driving developmental fates. Analyzing organismal systems from this perspective of logic and function has important implications for studies examining the evolution and conservation of signaling pathways.
| S-EPMC9879150 | biostudies-literature
Project description:BackgroundSarcopenia is an age-related muscle disease that increases the risk of falls, disabilities, and death. It is associated with increased muscle protein degradation driven by molecular signalling pathways including Akt and FOXO1. This study aims to identify genes, gene interactions, and molecular pathways and processes associated with muscle aging and exercise in older adults that remained undiscovered until now leveraging on an artificial intelligence approach called artificial neural network inference (ANNi).MethodsFour datasets reporting the profile of muscle transcriptome obtained by RNA-seq of young (21-43 years) and older adults (63-79 years) were selected and retrieved from the Gene Expression Omnibus (GEO) data repository. Two datasets contained the transcriptome profiles associated to muscle aging and two the transcriptome linked to resistant exercise in older adults, the latter before and after 6 months of exercise training. Each dataset was individually analysed by ANNi based on a swarm neural network approach integrated into a deep learning model (Intelligent Omics). This allowed us to identify top 200 genes influencing (drivers) or being influenced (targets) by aging or exercise and the strongest interactions between such genes. Downstream gene ontology (GO) analysis of these 200 genes was performed using Metacore (Clarivate™) and the open-source software, Metascape. To confirm the differential expression of the genes showing the strongest interactions, real-time quantitative PCR (RT-qPCR) was employed on human muscle biopsies obtained from eight young (25 ± 4 years) and eight older men (78 ± 7.6 years), partaking in a 6-month resistance exercise training programme.ResultsCHAD, ZDBF2, USP54, and JAK2 were identified as the genes with the strongest interactions predicting aging, while SCFD1, KDM5D, EIF4A2, and NIPAL3 were the main interacting genes associated with long-term exercise in older adults. RT-qPCR confirmed significant upregulation of USP54 (P = 0.005), CHAD (P = 0.03), and ZDBF2 (P = 0.008) in the aging muscle, while exercise-related genes were not differentially expressed (EIF4A2 P = 0.99, NIPAL3 P = 0.94, SCFD1 P = 0.94, and KDM5D P = 0.64). GO analysis related to skeletal muscle aging suggests enrichment of pathways linked to bone development (adj P-value 0.006), immune response (adj P-value <0.001), and apoptosis (adj P-value 0.01). In older exercising adults, these were ECM remodelling (adj P-value <0.001), protein folding (adj P-value <0.001), and proteolysis (adj P-value <0.001).ConclusionsUsing ANNi and RT-qPCR, we identified three strongly interacting genes predicting muscle aging, ZDBF2, USP54, and CHAD. These findings can help to inform the design of nonpharmacological and pharmacological interventions that prevent or mitigate sarcopenia.
| S-EPMC11446686 | biostudies-literature