Search arXiv⌕ Search

arXiv · q-bio/0510027

Mathematical approaches to differentiation and gene regulation

Abstract

We consider some mathematical issues raised by the modelling of gene networks. The expression of genes is governed by a complex set of regulations, which is often described symbolically by interaction graphs. Once such a graph has been established, there remains the difficult task to decide which dynamical properties of the gene network can be inferred from it, in the absence of precise quantitative data about their regulation. In this paper we discuss a rule proposed by R.Thomas according to which the possibility for the network to have several stationary states implies the existence of a positive circuit in the corresponding interaction graph. We prove that, when properly formulated in rigorous terms, this rule becomes a theorem valid for several different types of formal models of gene networks. This result is already known for models of differential or boolean type. We show here that a stronger version of it holds in the differential setup when the decay of protein concentrations is taken into account. This allows us to verify also the validity of Thomas' rule in the context of piecewise-linear models and the corresponding discrete models. We discuss open problems as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

C. Soulé. 2005-10-14. Mathematical approaches to differentiation and gene regulation. https://arxiv.org/abs/q-bio/0510027

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Minimality in Reflexive and Stoichiometric Autocatalysis

Autocatalysis, the ability of a chemical subsystem to sustain its own constituents when supplied with sufficient food molecules, has been closely related to the origin of life on Earth. Emerging from Wilhelm Ostwald's considerations about an explicit autocatalytic reaction, different notions of autocatalysis have been developed over the years. The two most prominent are reflexively autocatalytic F-generated sets (RAFs) and stoichiometric autocatalysis. After having shown that each RAFs is, under reasonable conditions, in general stoichiometrically autocatalytic, we examine here the relationship between the two notions of minimality: irreducible RAFs and autocatalytic cores. To this end, we overcome the obstacle that RAFs and stoichiometric autocatalysis have been formalized in distinct systems of chemical reactions, i.e., catalytic reaction systems (CRS) and chemical reaction networks (CRNs), respectively. We show that reactions in a CRS constitute equivalence classes of reactions of the corresponding CRNs w.r.t. their specific catalyzations. Using the fact that CRN and CRS can be canonically identified whenever each CRS reaction is associated with a single catalyzation, we demonstrate that the Kőnig graph of a monocatalyzed, irreducible RAF is composed of strong blocks devoid of food and waste species that are separated by reaction vertices, each of which contains an autocatalytic core. In fact, a single irreducible RAF can, in general, contain exponentially many autocatalytic cores.

q-bio.MN↗

Implementation of Linear Regression and Linear Interpolation using Reaction Networks

Statistical inference is a fundamental component of data science. In this work, we focus on two classical inference techniques: regression and interpolation. We propose a reaction-network-based framework for implementing linear regression, including both univariate and multivariate settings, as well as linear interpolation. Our approach encodes the outputs of these inference techniques in the steady-state concentrations of species within the reaction network. A key ingredient of the construction is a novel generalized division module capable of handling division involving negative numbers. We validate the proposed framework through in silico implementations on standard synthetic datasets and obtain the expected regression and interpolation outputs.

q-bio.MN↗

Mapping disease-regulatory flux through eQTL-based causal gene networks: a complex-trait framework applied to coronary artery disease

A substantial proportion of inherited susceptibility to common diseases is mediated through tissue-specific regulatory variation. The omnigenic model hypothesizes that much of this risk arises from distant (trans) regulatory effects that are propagated via gene-regulatory networks (GRNs) from numerous regulatory genes onto a relatively small set of core genes. Two major challenges have hindered an empirical assessment of this model. First, transcriptome-wide association studies primarily assess gene expression that is regulated locally (in cis), and thus miss trans-acting effects. Second, trans regulation has so far been examined only in aggregate, without identifying which regulatory genes transmit disease-associated signals to which target genes. Here, we present a framework that decomposes each gene's disease association into a local cis component and a set of trans components attributable to its upstream regulators, propagated along a directed causal GRN. For each gene, we estimate sparse Bayesian expression models and we assess model performance using out-of-sample prediction. Propagating trans signals through the inferred network yields a disease-regulatory flux map: a directed, signed representation that quantifies the contribution of each regulator to the disease association of each target gene. Applying this framework to seven tissues relevant to coronary artery disease, we demonstrate how genetic variation flows through the GRN to affect disease risk. Outgoing regulatory influences from individual genes are directionally heterogeneous, whereas disease-associated genes tend to integrate convergent input from multiple regulators; these convergent targets are enriched for cardiovascular-related biological processes. Consequently, each gene's disease association can be reinterpreted as a detailed allocation of the disease signal among its contributing regulators.

q-bio.MN↗