From reaction models to influence graphs and back: A theorem

François Fages, Sylvain Soliman

Research output: Contribution to journalConference articlepeer-review

Abstract

Biologists use diagrams to represent interactions between molecular species, and on the computer, diagrammatic notations are also more and more employed in interactive maps. These diagrams are fundamentally of two types: reaction graphs and activation/inhibition graphs. In this paper, we study the formal relationship between these graphs. We consider systems of biochemical reactions with kinetic expressions, as written in the Systems Biology Markup Language SBML, and interpreted by a system of Ordinary Differential Equations over molecular concentrations. We show that under a general condition of increasing monotonicity of the kinetic expressions, and in absence of both activation and inhibition effects between a pair of molecules, the influence graph inferred from the stoichiometric coefficients of the reactions is equal to the one defined by the signs of the coefficients of the Jacobian matrix. Under these conditions, satisfied by mass action law, Michaelis-Menten and Hill kinetics, the influence graph is thus independent of the precise kinetic expressions, and is computable in linear time in the number of reactions. We apply these results to Kohn's map of the mammalian cell cycle and to the MAPK signalling cascade. Then we propose a syntax for denoting antagonists in reaction rules and generalize our results to this setting.

Original languageEnglish
Pages (from-to)90-102
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5054 LNBI
DOIs
Publication statusPublished - 18 Jul 2008
Externally publishedYes
Event1st International Workshop on Formal Methods in Systems Biology, FMSB 2008 - Cambridge, United Kingdom
Duration: 4 Jun 20085 Jun 2008

Fingerprint

Dive into the research topics of 'From reaction models to influence graphs and back: A theorem'. Together they form a unique fingerprint.

Cite this