ABSTRACTIn an age where the volume of data regarding biological systems exceeds our ability to analyse it, many researchers are looking towards systems biology and computational modelling to help unravel the complexities of gene and protein regulatory networks. In particular, the use of discrete modelling allows generation of signalling networks in the absence of full quantitative descriptions of systems, which are necessary for ordinary differential equation (ODE) models. In order to make such techniques more accessible to mainstream researchers, tools such as the BioModelAnalyzer (BMA) have been developed to provide a user-friendly graphical interface for discrete modelling of biological systems. Here we use the BMA to build a library of discrete target functions of known canonical molecular interactions, translated from ordinary differential equations (ODEs). We then show that these BMA target functions can be used to reconstruct complex networks, which can correctly predict many known genetic perturbations. This new library supports the accessibility ethos behind the creation of BMA, providing a toolbox for the construction of complex cell signalling models without the need for extensive experience in computer programming or mathematical modelling, and allows for construction and simulation of complex biological systems with only small amounts of quantitative data.AUTHOR SUMMARYOrdinary differential equation (ODE) based models are a popular approach for modelling biological networks. A limitation of ODE models is that they require complete networks and detailed kinetic parameterisation. An alternative is the use of discrete, executable models, in which nodes are assigned discrete value ranges, and the relationship between them defined with simple mathematical operations. One tool for constructing such models is the BioModelAnalyzer (BMA), an open source and publicly available (https://www.biomodelanalyzer.org) software, aimed to be fully usable by researchers without extensive computational or mathematical experience. A fundamental question for executable models is whether the high level of abstraction substantially reduces expressivity relative to continuous approaches. Here, we present a canonical library of biological signalling motifs, initially defined by Tyson et al (2003), translated for the first time into the BMA. We show that; 1) these motifs are easily and fully translatable from continuous to discrete models, 2) Combining these motifs in a computationally naïve way generates a fully functional and predictive model of the yeast cell cycle.
Information Flow in Planar Polarity
