Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Grégory Batt

dblp:05/1010 · DBLP profile ↗
← Back
15ranked-venue papers
5as first author
2since 2021 · last 2022
0000-0003-1697-139XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 10 · 2 first-author · 2 since 2021Theory of computation · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
7 papers
Bioinformatics and computational biology · 93% Computational science and engineering · 7%
Theoretical computer science
3 papers
Logic in computer science · 52% Automated reasoning and model checking · 48%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › systems biology › cellular dynamics
apoptosis modeling
0.312017
Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway · Bioinform. 2017
Bioinformatics and computational biology
systems biology
0.312017
Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway · Bioinform. 2017
Bioinformatics and computational biology › gene regulation
gene regulatory network
0.222011
From Cardiac Cells to Genetic Regulatory Networks · CAV 2011
Analysis and Verification of Qualitative Models of Genetic Regulatory Networks: A Model-Checking Approach · IJCAI 2005
Bioinformatics and computational biology › systems biology
gene regulatory network modeling
0.212013
Composition and abstraction of logical regulatory modules: application to multicellular systems · Bioinform. 2013
Bioinformatics and computational biology › systems biology › computational systems biology
systems biology modeling
0.112011
From Cardiac Cells to Genetic Regulatory Networks · CAV 2011
Bioinformatics and computational biology › gene regulation › gene regulatory network
gene regulatory network analysis
0.112010
Efficient parameter search for qualitative models of regulatory networks using symbolic model checking · Bioinform. 2010
Computational science and engineering
parameter space exploration
0.112010
Efficient parameter search for qualitative models of regulatory networks using symbolic model checking · Bioinform. 2010
Bioinformatics and computational biology
synthetic biology
0.112009
A general computational method for robustness analysis with applications to synthetic gene networks · Bioinform. 2009
Logic in computer science › temporal logic
linear temporal logic
0.112009
A general computational method for robustness analysis with applications to synthetic gene networks · Bioinform. 2009
Bioinformatics and computational biology
qualitative modeling
0.112005
Analysis and Verification of Qualitative Models of Genetic Regulatory Networks: A Model-Checking Approach · IJCAI 2005
Automated reasoning and model checking
model checking
0.112005
Analysis and Verification of Qualitative Models of Genetic Regulatory Networks: A Model-Checking Approach · IJCAI 2005
Automated reasoning and model checking › model checking
symbolic model checking
0.012010
Efficient parameter search for qualitative models of regulatory networks using symbolic model checking · Bioinform. 2010

Methods — techniques the papers use, named apart from their topics

model checking · 0.3mutual information · 0.3information theory · 0.3entropy discretization · 0.3dynamic bayesian network · 0.3symbolic model checking · 0.2safety equivalence · 0.2process algebra · 0.2minimization · 0.2abstraction · 0.2
YearPublicationVenuePosition
2022 Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level
abstract
Understanding and characterising biochemical processes inside single cells requires experimental platforms that allow one to perturb and observe the dynamics of such processes as well as computational methods to build and parameterise models from the collected data. Recent progress with experimental platforms and optogenetics has made it possible to expose each cell in an experiment to an individualised input and automatically record cellular responses over days with fine time resolution. However, methods to infer parameters of stochastic kinetic models from single-cell longitudinal data have generally been developed under the assumption that experimental data is sparse and that responses of cells to at most a few different input perturbations can be observed. Here, we investigate and compare different approaches for calculating parameter likelihoods of single-cell longitudinal data based on approximations of the chemical master equation (CME) with a particular focus on coupling the linear noise approximation (LNA) or moment closure methods to a Kalman filter. We show that, as long as cells are measured sufficiently frequently, coupling the LNA to a Kalman filter allows one to accurately approximate likelihoods and to infer model parameters from data even in cases where the LNA provides poor approximations of the CME. Furthermore, the computational cost of filtering-based iterative likelihood evaluation scales advantageously in the number of measurement times and different input perturbations and is thus ideally suited for data obtained from modern experimental platforms. To demonstrate the practical usefulness of these results, we perform an experiment in which single cells, equipped with an optogenetic gene expression system, are exposed to various different light-input sequences and measured at several hundred time points and use parameter inference based on iterative likelihood evaluation to parameterise a stochastic model of the system.
Andjela Davidovic, Remy Chait, Grégory Batt, Jakob Ruess
PLoS Comput. Biol.3
2021 Beyond the chemical master equation: Stochastic chemical kinetics coupled with auxiliary processes
abstract
The chemical master equation and its continuum approximations are indispensable tools in the modeling of chemical reaction networks. These are routinely used to capture complex nonlinear phenomena such as multimodality as well as transient events such as first-passage times, that accurately characterise a plethora of biological and chemical processes. However, some mechanisms, such as heterogeneous cellular growth or phenotypic selection at the population level, cannot be represented by the master equation and thus have been tackled separately. In this work, we propose a unifying framework that augments the chemical master equation to capture such auxiliary dynamics, and we develop and analyse a numerical solver that accurately simulates the system dynamics. We showcase these contributions by casting a diverse array of examples from the literature within this framework and applying the solver to both match and extend previous studies. Analytical calculations performed for each example validate our numerical results and benchmark the solver implementation.
Davin Lunz, Grégory Batt, Jakob Ruess, J. Frédéric Bonnans
PLoS Comput. Biol.2
2017 Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway
abstract
MOTIVATION: Quantitative models are increasingly used in systems biology. Usually, these quantitative models involve many molecular species and their associated reactions. When simulating a tissue with thousands of cells, using these large models becomes computationally and time limiting. RESULTS: In this paper, we propose to construct abstractions using information theory notions. Entropy is used to discretize the state space and mutual information is used to select a subset of all original variables and their mutual dependencies. We apply our method to an hybrid model of TRAIL-induced apoptosis in HeLa cell. Our abstraction, represented as a Dynamic Bayesian Network (DBN), reduces the number of variables from 92 to 10, and accelerates numerical simulation by an order of magnitude, yet preserving essential features of cell death time distributions. AVAILABILITY AND IMPLEMENTATION: This approach is implemented in the tool DBNizer, freely available at http://perso.crans.org/genest/DBNizer . CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sucheendra K. Palaniappan, François Bertaux, Matthieu Pichené, Eric Fabre, Grégory Batt, Blaise Genest
Bioinform.5
2016 What Population Reveals about Individual Cell Identity: Single-Cell Parameter Estimation of Models of Gene Expression in Yeast
abstract
Significant cell-to-cell heterogeneity is ubiquitously observed in isogenic cell populations. Consequently, parameters of models of intracellular processes, usually fitted to population-averaged data, should rather be fitted to individual cells to obtain a population of models of similar but non-identical individuals. Here, we propose a quantitative modeling framework that attributes specific parameter values to single cells for a standard model of gene expression. We combine high quality single-cell measurements of the response of yeast cells to repeated hyperosmotic shocks and state-of-the-art statistical inference approaches for mixed-effects models to infer multidimensional parameter distributions describing the population, and then derive specific parameters for individual cells. The analysis of single-cell parameters shows that single-cell identity (e.g. gene expression dynamics, cell size, growth rate, mother-daughter relationships) is, at least partially, captured by the parameter values of gene expression models (e.g. rates of transcription, translation and degradation). Our approach shows how to use the rich information contained into longitudinal single-cell data to infer parameters that can faithfully represent single-cell identity.
Artémis Llamosi, Andrés M. González-Vargas, Cristian Versari, Eugenio Cinquemani, Giancarlo Ferrari-Trecate, Pascal Hersen, Grégory Batt
PLoS Comput. Biol.7
2014 Cells driven by computers: long-term model predictive control of gene expression in yeast
abstract
Real-time control has been recently applied to drive actual intracellular processes with unprecedented accuracy. Here we introduce the motivations for the development of these approaches and then present a platform for the real-time control of gene expression in yeast cells. We conclude by surveying related works and discussing possible future directions.
Grégory Batt
HSCC1
2014 Modeling Dynamics of Cell-to-Cell Variability in TRAIL-Induced Apoptosis Explains Fractional Killing and Predicts Reversible Resistance
abstract
Isogenic cells sensing identical external signals can take markedly different decisions. Such decisions often correlate with pre-existing cell-to-cell differences in protein levels. When not neglected in signal transduction models, these differences are accounted for in a static manner, by assuming randomly distributed initial protein levels. However, this approach ignores the a priori non-trivial interplay between signal transduction and the source of this cell-to-cell variability: temporal fluctuations of protein levels in individual cells, driven by noisy synthesis and degradation. Thus, modeling protein fluctuations, rather than their consequences on the initial population heterogeneity, would set the quantitative analysis of signal transduction on firmer grounds. Adopting this dynamical view on cell-to-cell differences amounts to recast extrinsic variability into intrinsic noise. Here, we propose a generic approach to merge, in a systematic and principled manner, signal transduction models with stochastic protein turnover models. When applied to an established kinetic model of TRAIL-induced apoptosis, our approach markedly increased model prediction capabilities. One obtains a mechanistic explanation of yet-unexplained observations on fractional killing and non-trivial robust predictions of the temporal evolution of cell resistance to TRAIL in HeLa cells. Our results provide an alternative explanation to survival via induction of survival pathways since no TRAIL-induced regulations are needed and suggest that short-lived anti-apoptotic protein Mcl1 exhibit large and rare fluctuations. More generally, our results highlight the importance of accounting for stochastic protein turnover to quantitatively understand signal transduction over extended durations, and imply that fluctuations of short-lived proteins deserve particular attention.
François Bertaux, Szymon Stoma, Dirk Drasdo, Grégory Batt
PLoS Comput. Biol.4
2013 Composition and abstraction of logical regulatory modules: application to multicellular systems
abstract
Abstract Motivation: Logical (Boolean or multi-valued) modelling is widely used to study regulatory or signalling networks. Even though these discrete models constitute a coarse, yet useful, abstraction of reality, the analysis of large networks faces a classical combinatorial problem. Here, we propose to take advantage of the intrinsic modularity of inter-cellular networks to set up a compositional procedure that enables a significant reduction of the dynamics, yet preserving the reachability of stable states. To that end, we rely on process algebras, a well-established computational technique for the specification and verification of interacting systems. Results: We develop a novel compositional approach to support the logical modelling of interconnected cellular networks. First, we formalize the concept of logical regulatory modules and their composition. Then, we make this framework operational by transposing the composition of logical modules into a process algebra framework. Importantly, the combination of incremental composition, abstraction and minimization using an appropriate equivalence relation (here the safety equivalence) yields huge reductions of the dynamics. We illustrate the potential of this approach with two case-studies: the Segment-Polarity and the Delta-Notch modules. Availability and implementation: GINsim (http://ginsim.org) and CADP (http://cadp.inria.fr) are freely available for academic users. Files needed to reproduce our results are provided at http://compbio.igc.gulbenkian.pt/nmd/node/45. Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online
Nuno D. Mendes, Frédéric Lang, Yves-Stan Le Cornec, Radu Mateescu 0001, Grégory Batt, Claudine Chaouiya
Bioinform.5
2013 STL-based Analysis of TRAIL-induced Apoptosis Challenges the Notion of Type I/Type II Cell Line Classification
abstract
Extrinsic apoptosis is a programmed cell death triggered by external ligands, such as the TNF-related apoptosis inducing ligand (TRAIL). Depending on the cell line, the specific molecular mechanisms leading to cell death may significantly differ. Precise characterization of these differences is crucial for understanding and exploiting extrinsic apoptosis. Cells show distinct behaviors on several aspects of apoptosis, including (i) the relative order of caspases activation, (ii) the necessity of mitochondria outer membrane permeabilization (MOMP) for effector caspase activation, and (iii) the survival of cell lines overexpressing Bcl2. These differences are attributed to the activation of one of two pathways, leading to classification of cell lines into two groups: type I and type II. In this work we challenge this type I/type II cell line classification. We encode the three aforementioned distinguishing behaviors in a formal language, called signal temporal logic (STL), and use it to extensively test the validity of a previously-proposed model of TRAIL-induced apoptosis with respect to experimental observations made on different cell lines. After having solved a few inconsistencies using STL-guided parameter search, we show that these three criteria do not define consistent cell line classifications in type I or type II, and suggest mutants that are predicted to exhibit ambivalent behaviors. In particular, this finding sheds light on the role of a feedback loop between caspases, and reconciliates two apparently-conflicting views regarding the importance of either upstream or downstream processes for cell-type determination. More generally, our work suggests that these three distinguishing behaviors should be merely considered as type I/II features rather than cell-type defining criteria. On the methodological side, this work illustrates the biological relevance of STL-diagrams, STL population data, and STL-guided parameter search implemented in the tool Breach. Such tools are well-adapted to the ever-increasing availability of heterogeneous knowledge on complex signal transduction pathways.
Szymon Stoma, Alexandre Donzé, François Bertaux, Oded Maler, Grégory Batt
PLoS Comput. Biol.5
2011 From Cardiac Cells to Genetic Regulatory Networks
Radu Grosu, Grégory Batt, Flavio H. Fenton, James Glimm, Colas Le Guernic, Scott A. Smolka, Ezio Bartocci
CAV2
2011 Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
Aurélien Rizk, Grégory Batt, François Fages, Sylvain Soliman
Theor. Comput. Sci.2
2010 Efficient parameter search for qualitative models of regulatory networks using symbolic model checking
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/.
Grégory Batt, Michel Page, Irene Cantone, Gregor Gößler, Pedro T. Monteiro 0001, Hidde de Jong
Bioinform.1
2009 A general computational method for robustness analysis with applications to synthetic gene networks
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/.
Aurélien Rizk, Grégory Batt, François Fages, Sylvain Soliman
Bioinform.2
2007 Model Checking Liveness Properties of Genetic Regulatory Networks
Grégory Batt, Calin Belta, Ron Weiss
TACAS1
2007 Robustness analysis and tuning of synthetic gene networks
abstract
MOTIVATION: The goal of synthetic biology is to design and construct biological systems that present a desired behavior. The construction of synthetic gene networks implementing simple functions has demonstrated the feasibility of this approach. However, the design of these networks is difficult, notably because existing techniques and tools are not adapted to deal with uncertainties on molecular concentrations and parameter values. RESULTS: We propose an approach for the analysis of a class of uncertain piecewise-multiaffine differential equation models. This modeling framework is well adapted to the experimental data currently available. Moreover, these models present interesting mathematical properties that allow the development of efficient algorithms for solving robustness analyses and tuning problems. These algorithms are implemented in the tool RoVerGeNe, and their practical applicability and biological relevance are demonstrated on the analysis of the tuning of a synthetic transcriptional cascade built in Escherichia coli. AVAILABILITY: RoVerGeNe and the transcriptional cascade model are available at http://iasi.bu.edu/%7Ebatt/rovergene/rovergene.htm.
Grégory Batt, Boyan Yordanov, Ron Weiss, Calin Belta
Bioinform.1
2005 Analysis and Verification of Qualitative Models of Genetic Regulatory Networks: A Model-Checking Approach
Grégory Batt, Delphine Ropers, Hidde de Jong, Johannes Geiselmann, Radu Mateescu 0001, Michel Page, Dominique Schneider
IJCAI1