Robustness and parameter geography in post-translational modification systems

Multistationarity questions in reduced versus extended biochemical networks

We address several questions in reduced versus extended networks via the elimination or addition of intermediate complexes in the framework of chemical reaction networks with mass-action kinetics. We clarify and extend advances in the literature concerning multistationarity in this context, mainly from Feliu and Wiuf (J R Soc Interface 10:20130484, 2013), Sadeghimanesh and Feliu (Bull Math Biol 81:2428-2462, 2019), Pérez Millán and Dickenstein (SIAM J Appl Dyn Syst 17(2):1650-1682, 2018), Dickenstein et al. (Bull Math Biol 81:1527-1581, 2019). We establish general results about MESSI systems, which we use to compute the circuits of multistationarity for significant biochemical networks.

The linear framework II: using graph theory to analyse the transient regime of Markov processes

The linear framework uses finite, directed graphs with labelled edges to model biomolecular systems. Graph vertices represent chemical species or molecular states, edges represent reactions or transitions and edge labels represent rates that also describe how the system is interacting with its environment. The present paper is a sequel to a recent review of the framework that focussed on how graph-theoretic methods give insight into steady states as rational algebraic functions of the edge labels. Here, we focus on the transient regime for systems that correspond to continuous-time Markov processes. In this case, the graph specifies the infinitesimal generator of the process. We show how the moments of the first-passage time distribution, and related quantities, such as splitting probabilities and conditional first-passage times, can also be expressed as rational algebraic functions of the labels. This capability is timely, as new experimental methods are finally giving access to the transient dynamic regime and revealing the computations and information processing that occur before a steady state is reached. We illustrate the concepts, methods and formulas through examples and show how the results may be used to illuminate previous findings in the literature.

Thermodynamic bounds on ultrasensitivity in covalent switching

Switch-like motifs are among the basic building blocks of biochemical networks. A common motif that can serve as an ultrasensitive switch consists of two enzymes acting antagonistically on a substrate, one making and the other removing a covalent modification. To work as a switch, such covalent modification cycles must be held out of thermodynamic equilibrium by continuous expenditure of energy. Here, we exploit the linear framework for timescale separation to establish tight bounds on the performance of any covalent-modification switch in terms of the chemical potential difference driving the cycle. The bounds apply to arbitrary enzyme mechanisms, not just Michaelis-Menten, with arbitrary rate constants and thereby reflect fundamental physical constraints on covalent switching.

Network regulation meets substrate modification chemistry

Biochemical networks are at the heart of cellular information processing. These networks contain distinct facets: (i) processing of information from the environment via cascades/pathways along with network regulation and (ii) modification of substrates in different ways, to confer protein functionality, stability and processing. While many studies focus on these factors individually, how they interact and the consequences for cellular systems behaviour are poorly understood. We develop a systems framework for this purpose by examining the interplay of network regulation (canonical feedback and feed-forward circuits) and multisite modification, as an exemplar of substrate modification. Using computational, analytical and semi-analytical approaches, we reveal distinct and unexpected ways in which the substrate modification and network levels combine and the emergent behaviour arising therefrom. This has important consequences for dissecting the behaviour of specific signalling networks, tracing the origins of systems behaviour, inference of networks from data, robustness/evolvability and multi-level engineering of biomolecular networks. Overall, we repeatedly demonstrate how focusing on only one level (say network regulation) can lead to profoundly misleading conclusions about all these aspects, and reveal a number of important consequences for experimental/theoretical/data-driven interrogations of cellular signalling systems.

Open problems in mathematical biology

Biology is data-rich, and it is equally rich in concepts and hypotheses. Part of trying to understand biological processes and systems is therefore to confront our ideas and hypotheses with data using statistical methods to determine the extent to which our hypotheses agree with reality. But doing so in a systematic way is becoming increasingly challenging as our hypotheses become more detailed, and our data becomes more complex. Mathematical methods are therefore gaining in importance across the life- and biomedical sciences. Mathematical models allow us to test our understanding, make testable predictions about future behaviour, and gain insights into how we can control the behaviour of biological systems. It has been argued that mathematical methods can be of great benefit to biologists to make sense of data. But mathematics and mathematicians are set to benefit equally from considering the often bewildering complexity inherent to living systems. Here we present a small selection of open problems and challenges in mathematical biology. We have chosen these open problems because they are of both biological and mathematical interest.

Polynomial superlevel set representation of the multistationarity region of chemical reaction networks

In this paper we introduce a new representation for the multistationarity region of a reaction network, using polynomial superlevel sets. The advantages of using this polynomial superlevel set representation over the already existing representations (cylindrical algebraic decompositions, numeric sampling, rectangular divisions) is discussed, and algorithms to compute this new representation are provided. The results are given for the general mathematical formalism of a parametric system of equations and so may be applied to other application domains.

The linear framework: using graph theory to reveal the algebra and thermodynamics of biomolecular systems

The linear framework uses finite, directed graphs with labelled edges to model biomolecular systems. Graph vertices represent biochemical species or molecular states, edges represent reactions or transitions and labels represent rates. The graph yields a linear dynamics for molecular concentrations or state probabilities, with the graph Laplacian as the operator, and the labels encode the nonlinear interactions between system and environment. The labels can be specified by vertices of other graphs or by conservation laws or, when the environment consists of thermodynamic reservoirs, they may be constants. In the latter case, the graphs correspond to infinitesimal generators of Markov processes. The key advantage of the framework has been that steady states are determined as rational algebraic functions of the labels by the Matrix-Tree theorems of graph theory. When the system is at thermodynamic equilibrium, this prescription recovers equilibrium statistical mechanics but it continues to hold for non-equilibrium steady states. The framework goes beyond other graph-based approaches in treating the graph as a mathematical object, for which general theorems can be formulated that accommodate biomolecular complexity. It has been particularly effective at analysing enzyme-catalysed modification systems and input-output responses.

High fidelity epigenetic inheritance: Information theoretic model predicts threshold filling of histone modifications post replication

During cell devision, maintaining the epigenetic information encoded in histone modification patterns is crucial for survival and identity of cells. The faithful inheritance of the histone marks from the parental to the daughter strands is a puzzle, given that each strand gets only half of the parental nucleosomes. Mapping DNA replication and reconstruction of modifications to equivalent problems in communication of information, we ask how well enzymes can recover the parental modifications, if they were ideal computing machines. Studying a parameter regime where realistic enzymes can function, our analysis predicts that enzymes may implement a critical threshold filling algorithm which fills unmodified regions of length at most k. This algorithm, motivated from communication theory, is derived from the maximum à posteriori probability (MAP) decoding which identifies the most probable modification sequence based on available observations. Simulations using our method produce modification patterns similar to what has been observed in recent experiments. We also show that our results can be naturally extended to explain inheritance of spatially distinct antagonistic modifications.

Mapping parameter spaces of biological switches

Since the seminal 1961 paper of Monod and Jacob, mathematical models of biomolecular circuits have guided our understanding of cell regulation. Model-based exploration of the functional capabilities of any given circuit requires systematic mapping of multidimensional spaces of model parameters. Despite significant advances in computational dynamical systems approaches, this analysis remains a nontrivial task. Here, we use a nonlinear system of ordinary differential equations to model oocyte selection in Drosophila, a robust symmetry-breaking event that relies on autoregulatory localization of oocyte-specification factors. By applying an algorithmic approach that implements symbolic computation and topological methods, we enumerate all phase portraits of stable steady states in the limit when nonlinear regulatory interactions become discrete switches. Leveraging this initial exact partitioning and further using numerical exploration, we locate parameter regions that are dense in purely asymmetric steady states when the nonlinearities are not infinitely sharp, enabling systematic identification of parameter regions that correspond to robust oocyte selection. This framework can be generalized to map the full parameter spaces in a broad class of models involving biological switches.

Identification of qualitatively different regimes in models of biomolecular switches is essential for understanding dynamics of complex biological processes, including symmetry breaking in cells and cell networks. We demonstrate how topological methods, symbolic computation, and numerical simulations can be combined for systematic mapping of symmetry-broken states in a mathematical model of oocyte specification in Drosophila, a leading experimental system of animal oogenesis. Our algorithmic framework reveals global connectedness of parameter domains corresponding to robust oocyte specification and enables systematic navigation through multidimensional parameter spaces in a large class of biomolecular switches.