Selected Publications

In recent years Systems Biology has become a rich field of study, trying to encompass all the information that has become available thanks to the new high-throughput techniques of biologists. Fifteen years ago, a fundamental breakthrough was the publication of Kurt Kohn’s map of the cell cycle control in mammals. Its similarity with electronic circuits was crucial in both making it impossible for humans to comprehend fully, and in prompting the use of formal methods […]
Habilitation à diriger des recherches, Université Paris Sud - Orsay, December, 2016.

Biochemical reaction networks grow bigger and bigger, fed by the high-throughput data provided by biologists and bred in open repositories of models allowing merging and evolution. Nevertheless, since the available data is still very far from permitting the identification of the increasing number of kinetic parameters of such models, the necessity of structural analyses for describing the dynamics of chemical networks appears stronger every day. Using the structural information, notably from the stoichiometric matrix, of a biochemical reaction system, we state a more strict version of the famous Thomas’ necessary condition for multistability […]
Bulletin of Mathematical Biology, 75 (11):2289-2303, November, 2013.

Background We present a way to compute the minimal semi-positive invariants of a Petri net representing a biological reaction system, as resolution of a Constraint Satisfaction Problem. The use of Petri nets to manipulate Systems Biology models and make available a variety of tools is quite old, and recently analyses based on invariant computation for biological models have become more and more frequent, for instance in the context of module decomposition. Results In our case, this analysis brings both qualitative and quantitative information on the models, in the form of conservation laws, consistency checking, etc […]
Algorithms for Molecular Biology, 7 (1):15, December, 2012.

interpretation is a theory of abstraction that has been introduced for the analysis of programs. In particular, it has proved useful for organizing the multiple semantics of a given programming language in a hierarchy corresponding to different detail levels, and for defining type systems for programming languages and program analyzers in software engineering. In this paper, we investigate the application of these concepts to systems biology formalisms […]
Theoretical Computer Science, 403 (1):52–70, August, 2008.

Other Recent Publications

More Publications

. On Inferring Reactions from Data Time Series by a Statistical Learning Greedy Heuristics. In Computational Methods in Systems Biology, Springer-Verlag, 2019.

PDF HAL

. A Statistical Unsupervised Learning Algorithm for Inferring Reaction Networks from Time Series Data. In ICML 2019 - Workshop on Computational Biology, 2019.

PDF HAL

. Graphical Requirements for Multistationarity in Reaction Networks and their Verification in BioModels. Journal of Theoretical Biology, 459:79–89, 2018.

PDF HAL DOI

. Influence Networks compared with Reaction Networks: Semantics, Expressivity and Attractors. IEEE/ACM Transactions on Computational Biology and Bioinformatics, PP (99):1-14, 2018.

PDF HAL DOI

. Executable Disease Networks: Adding dynamics to molecular maps. ECCB 2018, 17th European Conference on Computational Biology, 2018.

HAL

Projects

ANR-DFG SYMBIONT

Symbolic Methods for Biological Networks

ANR BioPSy

Hybrid Formal Modelling of Time for Circadian Clock Biology and Chronopharmacology

ANR HyClock

Hybrid Formal Modelling of Time for Circadian Clock Biology and Chronopharmacology

French-German PROCOPE Mobility Grant

O. Radulescu, Univ. Montpellier, France, Andreas Weber, Univ. Bonn, Germany

Teaching

I teach/taught in the following frameworks:

  • in the Paris Computer Science Masters (M2 Research), I am in charge of the Constraint Programming course;

    • class 1 - Introduction to CLP, operational semantics, examples
    • class 2 - CLP: fixpoint semantics
    • class 3 - CLP: logical semantics, CSP: solving by simplification and domain reduction
    • class 4 - CLP: the Warren Abstract Machine, CSP: Symmetries
    • class 5 - CLP: typing; CHR; Programming project discussion; MiniZinc and CLPZinc
    • class 6 - CC: examples, operational and denotational semantics
    • class 7 - CC: linear logic semantics; LCC
    • class 8 - LCC: logical semantics, links with CHR; EMoP: modules for LCC/CC/CLP
  • I also co-organize the 2nd year Modal INF473L – Programming in the Language of Life.

  • I used to be for several years teaching assistant for Java classes corresponding to the Informatique Fondamentale lessons of Jean-Jacques Levy in that same École Polytechnique.

I also supervize some internships on the dedicated page of the Lifeware team.

Recent Posts

More Posts

CellDesigner model to SBML-Qual encoded logical model converter

   ______      _____ ____ 
  / ____/___ _/ ___// __ \
 / /   / __ …

This is a set of reasonable guidelines for formatting Prolog programs, freely adapted from Caml guidelines and M. Covington’s …

Nontransitive dice

.ode to reaction model converter

This page allows you to convert a system of ordinary differential equations in the .ode format of …

CellDesigner model to influence graph converter

This page allows you to convert a CellDesigner model to a supposedly meaningful …

Contact