Maximal aggregation of polynomial dynamical systems

Reducing Boolean networks with backward equivalence

BACKGROUND

Boolean Networks (BNs) are a popular dynamical model in biology where the state of each component is represented by a variable taking binary values that express, for instance, activation/deactivation or high/low concentrations. Unfortunately, these models suffer from the state space explosion, i.e., there are exponentially many states in the number of BN variables, which hampers their analysis.

RESULTS

We present Boolean Backward Equivalence (BBE), a novel reduction technique for BNs which collapses system variables that, if initialized with same value, maintain matching values in all states. A large-scale validation on 86 models from two online model repositories reveals that BBE is effective, since it is able to reduce more than 90% of the models. Furthermore, on such models we also show that BBE brings notable analysis speed-ups, both in terms of state space generation and steady-state analysis. In several cases, BBE allowed the analysis of models that were originally intractable due to the complexity. On two selected case studies, we show how one can tune the reduction power of BBE using model-specific information to preserve all dynamics of interest, and selectively exclude behavior that does not have biological relevance.

CONCLUSIONS

BBE complements existing reduction methods, preserving properties that other reduction methods fail to reproduce, and vice versa. BBE drops all and only the dynamics, including attractors, originating from states where BBE-equivalent variables have been initialized with different activation values The remaining part of the dynamics is preserved exactly, including the length of the preserved attractors, and their reachability from given initial conditions, without adding any spurious behaviours. Given that BBE is a model-to-model reduction technique, it can be combined with further reduction methods for BNs.

Exploring the link between chronobiology and drug delivery: effects on cancer therapy

Circadian clock is an impressive timing system responsible for the control of several metabolic, physiological and behavioural processes. Nowadays, the connection between the circadian clock and cancer occurrence and development is consensual. Therefore, the inclusion of circadian timing into cancer therapy may potentially offer a more effective and less toxic approach. This way, chronotherapy has been shown to improve cancer treatment efficacy. Despite this relevant finding, its clinical application is poorly exploited. The conception of novel anticancer drug delivery systems and the combination of chronobiology with nanotechnology may provide a powerful tool to optimize cancer therapy, instigating the incorporation of the circadian timing into clinical practice towards a more personalized drug delivery. This review focuses on the recent advances in the field of cancer chronobiology, on the link between cancer and the disruption of circadian rhythms and on the promising targeted drug nanodelivery approaches aiming the clinical application of cancer chronotherapy.

Improved estimations of stochastic chemical kinetics by finite-state expansion

Stochastic reaction networks are a fundamental model to describe interactions between species where random fluctuations are relevant. The master equation provides the evolution of the probability distribution across the discrete state space consisting of vectors of population counts for each species. However, since its exact solution is often elusive, several analytical approximations have been proposed. The deterministic rate equation (DRE) gives a macroscopic approximation as a compact system of differential equations that estimate the average populations for each species, but it may be inaccurate in the case of nonlinear interaction dynamics. Here we propose finite-state expansion (FSE), an analytical method mediating between the microscopic and the macroscopic interpretations of a stochastic reaction network by coupling the master equation dynamics of a chosen subset of the discrete state space with the mean population dynamics of the DRE. An algorithm translates a network into an expanded one where each discrete state is represented as a further distinct species. This translation exactly preserves the stochastic dynamics, but the DRE of the expanded network can be interpreted as a correction to the original one. The effectiveness of FSE is demonstrated in models that challenge state-of-the-art techniques due to intrinsic noise, multi-scale populations and multi-stability.

CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations

MOTIVATION

Detailed mechanistic models of biological processes can pose significant challenges for analysis and parameter estimations due to the large number of equations used to track the dynamics of all distinct configurations in which each involved biochemical species can be found. Model reduction can help tame such complexity by providing a lower-dimensional model in which each macro-variable can be directly related to the original variables.

RESULTS

We present CLUE, an algorithm for exact model reduction of systems of polynomial differential equations by constrained linear lumping. It computes the smallest dimensional reduction as a linear mapping of the state space such that the reduced model preserves the dynamics of user-specified linear combinations of the original variables. Even though CLUE works with nonlinear differential equations, it is based on linear algebra tools, which makes it applicable to high-dimensional models. Using case studies from the literature, we show how CLUE can substantially lower model dimensionality and help extract biologically intelligible insights from the reduction.

AVAILABILITY

An implementation of the algorithm and relevant resources to replicate the experiments herein reported are freely available for download at https://github.com/pogudingleb/CLUE.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

SeQuaiA: A Scalable Tool for Semi-Quantitative Analysis of Chemical Reaction Networks

Chemical reaction networks (CRNs) play a fundamental role in analysis and design of biochemical systems. They induce continuous-time stochastic systems, whose analysis is a computationally intensive task. We present a tool that implements the recently proposed semi-quantitative analysis of CRN. Compared to the proposed theory, the tool implements the analysis so that it is more flexible and more precise. Further, its GUI offers a wide range of visualization procedures that facilitate the interpretation of the analysis results as well as guidance to refine the analysis. Finally, we define and implement a new notion of “mean” simulations, summarizing the typical behaviours of the system in a way directly comparable to standard simulations produced by other tools.

Modeling cell line-specific recruitment of signaling proteins to the insulin-like growth factor 1 receptor

Receptor tyrosine kinases (RTKs) typically contain multiple autophosphorylation sites in their cytoplasmic domains. Once activated, these autophosphorylation sites can recruit downstream signaling proteins containing Src homology 2 (SH2) and phosphotyrosine-binding (PTB) domains, which recognize phosphotyrosine-containing short linear motifs (SLiMs). These domains and SLiMs have polyspecific or promiscuous binding activities. Thus, multiple signaling proteins may compete for binding to a common SLiM and vice versa. To investigate the effects of competition on RTK signaling, we used a rule-based modeling approach to develop and analyze models for ligand-induced recruitment of SH2/PTB domain-containing proteins to autophosphorylation sites in the insulin-like growth factor 1 (IGF1) receptor (IGF1R). Models were parameterized using published datasets reporting protein copy numbers and site-specific binding affinities. Simulations were facilitated by a novel application of model restructuration, to reduce redundancy in rule-derived equations. We compare predictions obtained via numerical simulation of the model to those obtained through simple prediction methods, such as through an analytical approximation, or ranking by copy number and/or K_D value, and find that the simple methods are unable to recapitulate the predictions of numerical simulations. We created 45 cell line-specific models that demonstrate how early events in IGF1R signaling depend on the protein abundance profile of a cell. Simulations, facilitated by model restructuration, identified pairs of IGF1R binding partners that are recruited in anti-correlated and correlated fashions, despite no inclusion of cooperativity in our models. This work shows that the outcome of competition depends on the physicochemical parameters that characterize pairwise interactions, as well as network properties, including network connectivity and the relative abundances of competitors.

Cells rely on networks of interacting biomolecules to sense and respond to environmental perturbations and signals. However, it is unclear how information is processed to generate appropriate and specific responses to signals, especially given that these networks tend to share many components. For example, receptors that detect distinct ligands and regulate distinct cellular activities commonly interact with overlapping sets of downstream signaling proteins. Here, to investigate the downstream signaling of a well-studied receptor tyrosine kinase (RTK), the insulin-like growth factor 1 (IGF1) receptor (IGF1R), we formulated and analyzed 45 cell line-specific mathematical models, which account for recruitment of 18 different binding partners to six sites of receptor autophosphorylation in IGF1R. The models were parameterized using available protein copy number and site-specific affinity measurements, and restructured to allow for network generation. We find that recruitment is influenced by the protein abundance profile of a cell, with different patterns of recruitment in different cell lines. Furthermore, in a given cell line, we find that pairs of IGF1R binding partners may be recruited in a correlated or anti-correlated fashion. We demonstrate that the simulations of the model have greater predictive power than protein copy number and/or binding affinity data, and that even a simple analytical model cannot reproduce the predicted recruitment ranking obtained via simulations. These findings represent testable predictions and indicate that the outputs of IGF1R signaling depend on cell line-specific properties in addition to the properties that are intrinsic to the biomolecules involved.

Computing with biological switches and clocks

The complex dynamics of biological systems is primarily driven by molecular interactions that underpin the regulatory networks of cells. These networks typically contain positive and negative feedback loops, which are responsible for switch-like and oscillatory dynamics, respectively. Many computing systems rely on switches and clocks as computational modules. While the combination of such modules in biological systems leads to a variety of dynamical behaviours, it is also driving development of new computing algorithms. Here we present a historical perspective on computation by biological systems, with a focus on switches and clocks, and discuss parallels between biology and computing. We also outline our vision for the future of biological computing.