Inferring Executable Models from Formalized Experimental Evidence

Executable symbolic models have been successfully used to analyze networks of biological reactions. However, the process of building an executable model from published experimental findings is still carried out manually. The process is very time consuming and requires expert knowledge. As a first step in addressing this problem, this paper introduces an automated method for deriving executable models from formalized experimental findings called datums. We identify the relevant data in a collection of datums. We then translate the information contained in datums to logical assertions. Together with a logical theory formalizing the interpretation of datums, these assertions are used to infer a knowledge base of reaction rules. These rules can then be assembled into executable models semi-automatically using the Pathway Logic system. We applied our technique to the experimental evidence relevant to Hras activation in response to Egf available in our datum knowledge base. When compared to the Pathway Logic model (curated manually from the same datums by an expert), our model makes most of the same predictions regarding reachability and knockouts. Missing information is due to missing assertions that require reasoning about the effects of mutations and background knowledge to generate. This is being addressed in ongoing work.

[1]  Riccardo Dondi,et al.  Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs , 2008, Algorithmica.

[2]  Michael L. Blinov,et al.  Pathway Commons at Virtual Cell: Use of Pathway Data For Mathematical Modeling , 2012 .

[3]  Hiroyuki Ogata,et al.  KEGG: Kyoto Encyclopedia of Genes and Genomes , 1999, Nucleic Acids Res..

[4]  Annegret Wagler,et al.  Reconstruction of extended Petri nets from time-series data by using logical control functions , 2013, Journal of mathematical biology.

[5]  D. Eisenberg,et al.  Protein interaction databases. , 2001, Current opinion in biotechnology.

[6]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[7]  José Meseguer,et al.  Twenty years of rewriting logic , 2010, J. Log. Algebraic Methods Program..

[8]  Mark A. Miller,et al.  A Dynamic Model of Guard Cell Abscisic Acid Signaling , 2006 .

[9]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[10]  Weiqing Wang,et al.  Perturbation Biology: Inferring Signaling Networks in Cellular Systems , 2013, PLoS Comput. Biol..

[11]  Terence P. Speed,et al.  Bayesian Inference of Signaling Network Topology in a Cancer Cell Line , 2012, Bioinform..

[12]  P. Lincoln,et al.  Symbolic Systems Biology and Pathway Logic , 2008 .

[13]  Annegret Wagler,et al.  Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks , 2011, BMC Systems Biology.

[14]  Carolyn L. Talcott,et al.  Multiple Representations of Biological Processes , 2006, Trans. Comp. Sys. Biology.

[15]  Monika Heiner,et al.  JAK/STAT signalling--an executable model assembled from molecule-centred modules demonstrating a module-oriented database concept for systems and synthetic biology. , 2012, Molecular bioSystems.

[16]  Eduardo Sontag,et al.  Inference of signal transduction networks from double causal evidence. , 2010, Methods in molecular biology.

[17]  Derek Ruths,et al.  Deriving executable models of biochemical network dynamics from qualitative data , 2009 .

[18]  Paul T. Groth,et al.  Building Executable Biological Pathway Models Automatically from BioPAX , 2013, LISC@ISWC.

[19]  T. Henzinger,et al.  Executable cell biology , 2007, Nature Biotechnology.

[20]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[21]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..