Identification of dynamic mass-action biochemical reaction networks using sparse Bayesian methods

Two wrongs do not make a right: the assumption that an inhibitor acts as an inverse activator

Models of biochemical networks are often large intractable sets of differential equations. To make sense of the complexity, relationships between genes/proteins are presented as connected graphs, the edges of which are drawn to indicate activation or inhibition relationships. These diagrams are useful for drawing qualitative conclusions in many cases by the identifying recurring of topological motifs, for example positive and negative feedback loops. These topological features are usually classified under the presumption that activation and inhibition are inverse relationships. For example, inhibition of an inhibitor is often classified the same as activation of an activator within a motif classification, effectively treating them as equivalent. Whilst in many contexts this may not lead to catastrophic errors, drawing conclusions about the behavior of motifs, pathways or networks from these broad classes of topological feature without adequate mathematical descriptions can lead to obverse outcomes. We investigate the extent to which a biochemical pathway/network will behave quantitatively dissimilar to pathway/ networks with similar typologies formed by swapping inhibitors as the inverse of activators. The purpose of the study is to determine under what circumstances rudimentary qualitative assessment of network structure can provide reliable conclusions as to the quantitative behaviour of the network. Whilst there are others, We focus on two main mathematical qualities which may cause a divergence in the behaviour of two pathways/networks which would otherwise be classified as similar; (i) a modelling feature we label 'bias' and (ii) the precise positioning of activators and inhibitors within simple pathways/motifs.

Distilling identifiable and interpretable dynamic models from biological data

Mechanistic dynamical models allow us to study the behavior of complex biological systems. They can provide an objective and quantitative understanding that would be difficult to achieve through other means. However, the systematic development of these models is a non-trivial exercise and an open problem in computational biology. Currently, many research efforts are focused on model discovery, i.e. automating the development of interpretable models from data. One of the main frameworks is sparse regression, where the sparse identification of nonlinear dynamics (SINDy) algorithm and its variants have enjoyed great success. SINDy-PI is an extension which allows the discovery of rational nonlinear terms, thus enabling the identification of kinetic functions common in biochemical networks, such as Michaelis-Menten. SINDy-PI also pays special attention to the recovery of parsimonious models (Occam's razor). Here we focus on biological models composed of sets of deterministic nonlinear ordinary differential equations. We present a methodology that, combined with SINDy-PI, allows the automatic discovery of structurally identifiable and observable models which are also mechanistically interpretable. The lack of structural identifiability and observability makes it impossible to uniquely infer parameter and state variables, which can compromise the usefulness of a model by distorting its mechanistic significance and hampering its ability to produce biological insights. We illustrate the performance of our method with six case studies. We find that, despite enforcing sparsity, SINDy-PI sometimes yields models that are unidentifiable. In these cases we show how our method transforms their equations in order to obtain a structurally identifiable and observable model which is also interpretable.

SBbadger: biochemical reaction networks with definable degree distributions

MOTIVATION

An essential step in developing computational tools for the inference, optimization and simulation of biochemical reaction networks is gauging tool performance against earlier efforts using an appropriate set of benchmarks. General strategies for the assembly of benchmark models include collection from the literature, creation via subnetwork extraction and de novo generation. However, with respect to biochemical reaction networks, these approaches and their associated tools are either poorly suited to generate models that reflect the wide range of properties found in natural biochemical networks or to do so in numbers that enable rigorous statistical analysis.

RESULTS

In this work, we present SBbadger, a python-based software tool for the generation of synthetic biochemical reaction or metabolic networks with user-defined degree distributions, multiple available kinetic formalisms and a host of other definable properties. SBbadger thus enables the creation of benchmark model sets that reflect properties of biological systems and generate the kinetics and model structures typically targeted by computational analysis and inference software. Here, we detail the computational and algorithmic workflow of SBbadger, demonstrate its performance under various settings, provide sample outputs and compare it to currently available biochemical reaction network generation software.

AVAILABILITY AND IMPLEMENTATION

SBbadger is implemented in Python and is freely available at https://github.com/sys-bio/SBbadger and via PyPI at https://pypi.org/project/SBbadger/. Documentation can be found at https://SBbadger.readthedocs.io.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.