1
|
Mendes P. Reproducibility and FAIR principles: the case of a segment polarity network model. Front Cell Dev Biol 2023; 11:1201673. [PMID: 37346177 PMCID: PMC10279958 DOI: 10.3389/fcell.2023.1201673] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/06/2023] [Accepted: 05/30/2023] [Indexed: 06/23/2023] Open
Abstract
The issue of reproducibility of computational models and the related FAIR principles (findable, accessible, interoperable, and reusable) are examined in a specific test case. I analyze a computational model of the segment polarity network in Drosophila embryos published in 2000. Despite the high number of citations to this publication, 23 years later the model is barely accessible, and consequently not interoperable. Following the text of the original publication allowed successfully encoding the model for the open source software COPASI. Subsequently saving the model in the SBML format allowed it to be reused in other open source software packages. Submission of this SBML encoding of the model to the BioModels database enables its findability and accessibility. This demonstrates how the FAIR principles can be successfully enabled by using open source software, widely adopted standards, and public repositories, facilitating reproducibility and reuse of computational cell biology models that will outlive the specific software used.
Collapse
Affiliation(s)
- Pedro Mendes
- Center for Cell Analysis and Modeling, University of Connecticut School of Medicine, Farmington, CT, United States
- Department of Cell Biology, University of Connecticut School of Medicine, Farmington, CT, United States
| |
Collapse
|
2
|
Nam KM, Gyori BM, Amethyst SV, Bates DJ, Gunawardena J. Robustness and parameter geography in post-translational modification systems. PLoS Comput Biol 2020; 16:e1007573. [PMID: 32365103 PMCID: PMC7224580 DOI: 10.1371/journal.pcbi.1007573] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/27/2019] [Revised: 05/14/2020] [Accepted: 04/02/2020] [Indexed: 11/23/2022] Open
Abstract
Biological systems are acknowledged to be robust to perturbations but a rigorous understanding of this has been elusive. In a mathematical model, perturbations often exert their effect through parameters, so sizes and shapes of parametric regions offer an integrated global estimate of robustness. Here, we explore this “parameter geography” for bistability in post-translational modification (PTM) systems. We use the previously developed “linear framework” for timescale separation to describe the steady-states of a two-site PTM system as the solutions of two polynomial equations in two variables, with eight non-dimensional parameters. Importantly, this approach allows us to accommodate enzyme mechanisms of arbitrary complexity beyond the conventional Michaelis-Menten scheme, which unrealistically forbids product rebinding. We further use the numerical algebraic geometry tools Bertini, Paramotopy, and alphaCertified to statistically assess the solutions to these equations at ∼109 parameter points in total. Subject to sampling limitations, we find no bistability when substrate amount is below a threshold relative to enzyme amounts. As substrate increases, the bistable region acquires 8-dimensional volume which increases in an apparently monotonic and sigmoidal manner towards saturation. The region remains connected but not convex, albeit with a high visibility ratio. Surprisingly, the saturating bistable region occupies a much smaller proportion of the sampling domain under mechanistic assumptions more realistic than the Michaelis-Menten scheme. We find that bistability is compromised by product rebinding and that unrealistic assumptions on enzyme mechanisms have obscured its parametric rarity. The apparent monotonic increase in volume of the bistable region remains perplexing because the region itself does not grow monotonically: parameter points can move back and forth between monostability and bistability. We suggest mathematical conjectures and questions arising from these findings. Advances in theory and software now permit insights into parameter geography to be uncovered by high-dimensional, data-centric analysis. Biological organisms are often said to have robust properties but it is difficult to understand how such robustness arises from molecular interactions. Here, we use a mathematical model to study how the molecular mechanism of protein modification exhibits the property of multiple internal states, which has been suggested to underlie memory and decision making. The robustness of this property is revealed by the size and shape, or “geography,” of the parametric region in which the property holds. We use advances in reducing model complexity and in rapidly solving the underlying equations, to extensively sample parameter points in an 8-dimensional space. We find that under realistic molecular assumptions the size of the region is surprisingly small, suggesting that generating multiple internal states with such a mechanism is much harder than expected. While the shape of the region appears straightforward, we find surprising complexity in how the region grows with increasing amounts of the modified substrate. Our approach uses statistical analysis of data generated from a model, rather than from experiments, but leads to precise mathematical conjectures about parameter geography and biological robustness.
Collapse
Affiliation(s)
- Kee-Myoung Nam
- Department of Systems Biology, Harvard Medical School, Boston, Massachusetts, United States of America
| | - Benjamin M. Gyori
- Laboratory of Systems Pharmacology, Harvard Medical School, Boston, Massachusetts, United States of America
| | - Silviana V. Amethyst
- Department of Mathematics, University of Wisconsin–Eau Claire, Eau Claire, Wisconsin, United States of America
| | - Daniel J. Bates
- Department of Mathematics, United States Naval Academy, Annapolis, Maryland, United States of America
| | - Jeremy Gunawardena
- Department of Systems Biology, Harvard Medical School, Boston, Massachusetts, United States of America
- * E-mail:
| |
Collapse
|
3
|
Conradi C, Feliu E, Mincheva M, Wiuf C. Identifying parameter regions for multistationarity. PLoS Comput Biol 2017; 13:e1005751. [PMID: 28972969 PMCID: PMC5626113 DOI: 10.1371/journal.pcbi.1005751] [Citation(s) in RCA: 45] [Impact Index Per Article: 6.4] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/30/2016] [Accepted: 08/31/2017] [Indexed: 01/20/2023] Open
Abstract
Mathematical modelling has become an established tool for studying the dynamics of biological systems. Current applications range from building models that reproduce quantitative data to identifying systems with predefined qualitative features, such as switching behaviour, bistability or oscillations. Mathematically, the latter question amounts to identifying parameter values associated with a given qualitative feature. We introduce a procedure to partition the parameter space of a parameterized system of ordinary differential equations into regions for which the system has a unique or multiple equilibria. The procedure is based on the computation of the Brouwer degree, and it creates a multivariate polynomial with parameter depending coefficients. The signs of the coefficients determine parameter regions with and without multistationarity. A particular strength of the procedure is the avoidance of numerical analysis and parameter sampling. The procedure consists of a number of steps. Each of these steps might be addressed algorithmically using various computer programs and available software, or manually. We demonstrate our procedure on several models of gene transcription and cell signalling, and show that in many cases we obtain a complete partitioning of the parameter space with respect to multistationarity.
Collapse
Affiliation(s)
| | - Elisenda Feliu
- Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark
- * E-mail:
| | - Maya Mincheva
- Department of Mathematical Sciences, Northern Illinois University, DeKalb, Illinois, United States of America
| | - Carsten Wiuf
- Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark
| |
Collapse
|
4
|
Dynamic compensation, parameter identifiability, and equivariances. PLoS Comput Biol 2017; 13:e1005447. [PMID: 28384175 PMCID: PMC5398758 DOI: 10.1371/journal.pcbi.1005447] [Citation(s) in RCA: 19] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/31/2016] [Revised: 04/20/2017] [Accepted: 03/06/2017] [Indexed: 12/30/2022] Open
Abstract
A recent paper by Karin et al. introduced a mathematical notion called dynamical compensation (DC) of biological circuits. DC was shown to play an important role in glucose homeostasis as well as other key physiological regulatory mechanisms. Karin et al. went on to provide a sufficient condition to test whether a given system has the DC property. Here, we show how DC can be formulated in terms of a well-known concept in systems biology, statistics, and control theory—that of parameter structural non-identifiability. Viewing DC as a parameter identification problem enables one to take advantage of powerful theoretical and computational tools to test a system for DC. We obtain as a special case the sufficient criterion discussed by Karin et al. We also draw connections to system equivalence and to the fold-change detection property. A recently introduced mathematical notion called dynamical compensation of biological circuits was shown to play an important role in glucose homeostasis and other key physiological regulatory mechanisms. This paper explains how dynamical compensation can be formulated in terms of a well-known concept in systems biology, statistics, and control theory—that of parameter structural non-identifiability. Viewing dynamical compensation as a parameter identification problem enables one to take advantage of powerful theoretical and computational tools to test a system for dynamical compensation. As a special case, one obtains the sufficient criterion for dynamical compensation. The paper also draws connections to system equivalence and to the fold-change detection property. The non-identifiability characterization brings up an interesting contrast in the way in which one thinks of these properties in the two fields. From the point of view of robustness of behavior, one wishes that parameters do not influence much the response of a system. On the other hand, from the systems and parameter identification point of view, the more that a parameter affects behavior, the easier it is to estimate it, and poor sensitivity is taken as an indication of a poorly parametrized model.
Collapse
|
5
|
Bianconi F, Baldelli E, Ludovini V, Luovini V, Petricoin EF, Crinò L, Valigi P. Conditional robustness analysis for fragility discovery and target identification in biochemical networks and in cancer systems biology. BMC SYSTEMS BIOLOGY 2015; 9:70. [PMID: 26482604 PMCID: PMC4617482 DOI: 10.1186/s12918-015-0216-5] [Citation(s) in RCA: 12] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/04/2015] [Accepted: 07/16/2015] [Indexed: 12/14/2022]
Abstract
Background The study of cancer therapy is a key issue in the field of oncology research and the development of target therapies is one of the main problems currently under investigation. This is particularly relevant in different types of tumor where traditional chemotherapy approaches often fail, such as lung cancer. Results We started from the general definition of robustness introduced by Kitano and applied it to the analysis of dynamical biochemical networks, proposing a new algorithm based on moment independent analysis of input/output uncertainty. The framework utilizes novel computational methods which enable evaluating the model fragility with respect to quantitative performance measures and parameters such as reaction rate constants and initial conditions. The algorithm generates a small subset of parameters that can be used to act on complex networks and to obtain the desired behaviors. We have applied the proposed framework to the EGFR-IGF1R signal transduction network, a crucial pathway in lung cancer, as an example of Cancer Systems Biology application in drug discovery. Furthermore, we have tested our framework on a pulse generator network as an example of Synthetic Biology application, thus proving the suitability of our methodology to the characterization of the input/output synthetic circuits. Conclusions The achieved results are of immediate practical application in computational biology, and while we demonstrate their use in two specific examples, they can in fact be used to study a wider class of biological systems. Electronic supplementary material The online version of this article (doi:10.1186/s12918-015-0216-5) contains supplementary material, which is available to authorized users.
Collapse
Affiliation(s)
- Fortunato Bianconi
- Dept of Experimental Medicine, University of Perugia, Polo Unico Sant'Andrea delle Fratte, Via Gambuli, 1, Perugia, 06156, IT.
| | - Elisa Baldelli
- Center for Applied Proteomics and Molecular Medicine George Mason University, 10900 University Blvd, Manassas, 20110, USA.
| | | | - Vienna Luovini
- Dept of Medical Oncology, Santa Maria della Misericordia Hospital, Azienda Ospedaliera di Perugia, Piazzale Menghini, 1, Loc. Sant'Andrea delle Fratte, Perugia, 06156, IT.
| | - Emanuel F Petricoin
- Center for Applied Proteomics and Molecular Medicine George Mason University, 10900 University Blvd, Manassas, 20110, USA.
| | - Lucio Crinò
- Dept of Medical Oncology, Santa Maria della Misericordia Hospital, Azienda Ospedaliera di Perugia, Piazzale Menghini, 1, Loc. Sant'Andrea delle Fratte, Perugia, 06156, IT.
| | - Paolo Valigi
- Dept of Engineering, University of Perugia, G. Duranti, 93, Perugia, 06125, IT.
| |
Collapse
|
6
|
Giacomantonio CE, Goodhill GJ. A computational model of the effect of gene misexpression on the development of cortical areas. BIOLOGICAL CYBERNETICS 2014; 108:203-221. [PMID: 24570351 DOI: 10.1007/s00422-014-0590-x] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/25/2013] [Accepted: 12/30/2013] [Indexed: 06/03/2023]
Abstract
Brain function depends on the specialisation of brain areas. In the murine cerebral cortex, the development of these areas depends on the coordinated expression of several genes in precise spatial patterns in the telencephalon during embryogenesis. Manipulating the expression of these genes during development alters the positions and sizes of cortical areas in the adult. Qualitative data also show that these genes regulate each other's expression during development so that they form a regulatory network with many feedback loops. However, it is currently unknown which regulatory interactions are critical to generating the correct expression patterns to lead to normal cortical development. Here, we formalise the relationships inferred from genetic manipulations into computational models. We simulate many different networks potentially consistent with the experimental data and show that a surprising diversity of networks produce similar results. This demonstrates that existing data cannot uniquely specify the network. We conclude by suggesting experiments necessary to constrain the model and help identify and understand the true structure of this regulatory network.
Collapse
Affiliation(s)
- Clare E Giacomantonio
- Queensland Brain Institute, The University of Queensland, St Lucia, QLD, 4072, Australia,
| | | |
Collapse
|
7
|
Streif S, Kim KKK, Rumschinski P, Kishida M, Shen DE, Findeisen R, Braatz RD. Robustness Analysis, Prediction and Estimation for Uncertain Biochemical Networks. ACTA ACUST UNITED AC 2013. [DOI: 10.3182/20131218-3-in-2045.00190] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/23/2022]
|
8
|
Bates DG, Cosentino C. Validation and invalidation of systems biology models using robustness analysis. IET Syst Biol 2011; 5:229-44. [PMID: 21823754 DOI: 10.1049/iet-syb.2010.0072] [Citation(s) in RCA: 36] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022] Open
Abstract
Robustness, the ability of a system to function correctly in the presence of both internal and external uncertainty, has emerged as a key organising principle in many biological systems. Biological robustness has thus become a major focus of research in Systems Biology, particularly on the engineering-biology interface, since the concept of robustness was first rigorously defined in the context of engineering control systems. This review focuses on one particularly important aspect of robustness in Systems Biology, that is, the use of robustness analysis methods for the validation or invalidation of models of biological systems. With the explosive growth in quantitative modelling brought about by Systems Biology, the problem of validating, invalidating and discriminating between competing models of a biological system has become an increasingly important one. In this review, the authors provide a comprehensive overview of the tools and methods that are available for this task, and illustrate the wide range of biological systems to which this approach has been successfully applied.
Collapse
Affiliation(s)
- D G Bates
- University of Exeter, College of Engineering, Mathematics and Physical Sciences, Exeter, UK.
| | | |
Collapse
|
9
|
Zamora-Sillero E, Hafner M, Ibig A, Stelling J, Wagner A. Efficient characterization of high-dimensional parameter spaces for systems biology. BMC SYSTEMS BIOLOGY 2011; 5:142. [PMID: 21920040 PMCID: PMC3201035 DOI: 10.1186/1752-0509-5-142] [Citation(s) in RCA: 74] [Impact Index Per Article: 5.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 01/20/2011] [Accepted: 09/15/2011] [Indexed: 11/22/2022]
Abstract
Background A biological system's robustness to mutations and its evolution are influenced by the structure of its viable space, the region of its space of biochemical parameters where it can exert its function. In systems with a large number of biochemical parameters, viable regions with potentially complex geometries fill a tiny fraction of the whole parameter space. This hampers explorations of the viable space based on "brute force" or Gaussian sampling. Results We here propose a novel algorithm to characterize viable spaces efficiently. The algorithm combines global and local explorations of a parameter space. The global exploration involves an out-of-equilibrium adaptive Metropolis Monte Carlo method aimed at identifying poorly connected viable regions. The local exploration then samples these regions in detail by a method we call multiple ellipsoid-based sampling. Our algorithm explores efficiently nonconvex and poorly connected viable regions of different test-problems. Most importantly, its computational effort scales linearly with the number of dimensions, in contrast to "brute force" sampling that shows an exponential dependence on the number of dimensions. We also apply this algorithm to a simplified model of a biochemical oscillator with positive and negative feedback loops. A detailed characterization of the model's viable space captures well known structural properties of circadian oscillators. Concretely, we find that model topologies with an essential negative feedback loop and a nonessential positive feedback loop provide the most robust fixed period oscillations. Moreover, the connectedness of the model's viable space suggests that biochemical oscillators with varying topologies can evolve from one another. Conclusions Our algorithm permits an efficient analysis of high-dimensional, nonconvex, and poorly connected viable spaces characteristic of complex biological circuitry. It allows a systematic use of robustness as a tool for model discrimination.
Collapse
|
10
|
Erguler K, Stumpf MPH. Practical limits for reverse engineering of dynamical systems: a statistical analysis of sensitivity and parameter inferability in systems biology models. MOLECULAR BIOSYSTEMS 2011; 7:1593-602. [PMID: 21380410 DOI: 10.1039/c0mb00107d] [Citation(s) in RCA: 75] [Impact Index Per Article: 5.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
Abstract
The size and complexity of cellular systems make building predictive models an extremely difficult task. In principle dynamical time-course data can be used to elucidate the structure of the underlying molecular mechanisms, but a central and recurring problem is that many and very different models can be fitted to experimental data, especially when the latter are limited and subject to noise. Even given a model, estimating its parameters remains challenging in real-world systems. Here we present a comprehensive analysis of 180 systems biology models, which allows us to classify the parameters with respect to their contribution to the overall dynamical behaviour of the different systems. Our results reveal candidate elements of control in biochemical pathways that differentially contribute to dynamics. We introduce sensitivity profiles that concisely characterize parameter sensitivity and demonstrate how this can be connected to variability in data. Systematically linking data and model sloppiness allows us to extract features of dynamical systems that determine how well parameters can be estimated from time-course measurements, and associates the extent of data required for parameter inference with the model structure, and also with the global dynamical state of the system. The comprehensive analysis of so many systems biology models reaffirms the inability to estimate precisely most model or kinetic parameters as a generic feature of dynamical systems, and provides safe guidelines for performing better inferences and model predictions in the context of reverse engineering of mathematical models for biological systems.
Collapse
Affiliation(s)
- Kamil Erguler
- Centre for Bioinformatics, Imperial College London, UK.
| | | |
Collapse
|
11
|
Batt G, Page M, Cantone I, Goessler G, Monteiro P, de Jong H. Efficient parameter search for qualitative models of regulatory networks using symbolic model checking. ACTA ACUST UNITED AC 2010; 26:i603-10. [PMID: 20823328 PMCID: PMC2935427 DOI: 10.1093/bioinformatics/btq387] [Citation(s) in RCA: 41] [Impact Index Per Article: 2.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
Abstract
Motivation: Investigating the relation between the structure and behavior of complex biological networks often involves posing the question if the hypothesized structure of a regulatory network is consistent with the observed behavior, or if a proposed structure can generate a desired behavior. Results: The above questions can be cast into a parameter search problem for qualitative models of regulatory networks. We develop a method based on symbolic model checking that avoids enumerating all possible parametrizations, and show that this method performs well on real biological problems, using the IRMA synthetic network and benchmark datasets. We test the consistency between IRMA and time-series expression profiles, and search for parameter modifications that would make the external control of the system behavior more robust. Availability: GNA and the IRMA model are available at http://ibis.inrialpes.fr/ Contact:gregory.batt@inria.fr Supplementary information:Supplementary data are available at Bioinformatics online.
Collapse
|
12
|
Gutiérrez J, St Laurent G, Urcuqui-Inchima S. Propagation of kinetic uncertainties through a canonical topology of the TLR4 signaling network in different regions of biochemical reaction space. Theor Biol Med Model 2010; 7:7. [PMID: 20230643 PMCID: PMC2907738 DOI: 10.1186/1742-4682-7-7] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/17/2009] [Accepted: 03/15/2010] [Indexed: 12/30/2022] Open
Abstract
Background Signal transduction networks represent the information processing systems that dictate which dynamical regimes of biochemical activity can be accessible to a cell under certain circumstances. One of the major concerns in molecular systems biology is centered on the elucidation of the robustness properties and information processing capabilities of signal transduction networks. Achieving this goal requires the establishment of causal relations between the design principle of biochemical reaction systems and their emergent dynamical behaviors. Methods In this study, efforts were focused in the construction of a relatively well informed, deterministic, non-linear dynamic model, accounting for reaction mechanisms grounded on standard mass action and Hill saturation kinetics, of the canonical reaction topology underlying Toll-like receptor 4 (TLR4)-mediated signaling events. This signaling mechanism has been shown to be deployed in macrophages during a relatively short time window in response to lypopolysaccharyde (LPS) stimulation, which leads to a rapidly mounted innate immune response. An extensive computational exploration of the biochemical reaction space inhabited by this signal transduction network was performed via local and global perturbation strategies. Importantly, a broad spectrum of biologically plausible dynamical regimes accessible to the network in widely scattered regions of parameter space was reconstructed computationally. Additionally, experimentally reported transcriptional readouts of target pro-inflammatory genes, which are actively modulated by the network in response to LPS stimulation, were also simulated. This was done with the main goal of carrying out an unbiased statistical assessment of the intrinsic robustness properties of this canonical reaction topology. Results Our simulation results provide convincing numerical evidence supporting the idea that a canonical reaction mechanism of the TLR4 signaling network is capable of performing information processing in a robust manner, a functional property that is independent of the signaling task required to be executed. Nevertheless, it was found that the robust performance of the network is not solely determined by its design principle (topology), but this may be heavily dependent on the network's current position in biochemical reaction space. Ultimately, our results enabled us the identification of key rate limiting steps which most effectively control the performance of the system under diverse dynamical regimes. Conclusions Overall, our in silico study suggests that biologically relevant and non-intuitive aspects on the general behavior of a complex biomolecular network can be elucidated only when taking into account a wide spectrum of dynamical regimes attainable by the system. Most importantly, this strategy provides the means for a suitable assessment of the inherent variational constraints imposed by the structure of the system when systematically probing its parameter space.
Collapse
Affiliation(s)
- Jayson Gutiérrez
- Grupo de Física y Astrofísica Computacional (FACom), Instituto de Física, Universidad de Antioquia, Medellin, Colombia.
| | | | | |
Collapse
|
13
|
Rizk A, Batt G, Fages F, Soliman S. A general computational method for robustness analysis with applications to synthetic gene networks. Bioinformatics 2009; 25:i169-78. [PMID: 19477984 PMCID: PMC2687954 DOI: 10.1093/bioinformatics/btp200] [Citation(s) in RCA: 73] [Impact Index Per Article: 4.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/25/2022] Open
Abstract
Motivation: Robustness is the capacity of a system to maintain a function in the face of perturbations. It is essential for the correct functioning of natural and engineered biological systems. Robustness is generally defined in an ad hoc, problem-dependent manner, thus hampering the fruitful development of a theory of biological robustness, recently advocated by Kitano. Results: In this article, we propose a general definition of robustness that applies to any biological function expressible in temporal logic LTL (linear temporal logic), and to broad model classes and perturbation types. Moreover, we propose a computational approach and an implementation in BIOCHAM 2.8 for the automated estimation of the robustness of a given behavior with respect to a given set of perturbations. The applicability and biological relevance of our approach is demonstrated by testing and improving the robustness of the timed behavior of a synthetic transcriptional cascade that could be used as a biological timer for synthetic biology applications. Availability: Version 2.8 of BIOCHAM and the transcriptional cascade model are available at http://contraintes.inria.fr/BIOCHAM/ Contact:gregory.batt@inria.fr
Collapse
Affiliation(s)
- Aurélien Rizk
- INRIA Paris-Rocquencourt, 78153 Le Chesnay Cedex, France
| | | | | | | |
Collapse
|