Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Forward collection in this case is application of rules without removing the premises.
- 2.
The assertion mapping code and logic are currently being extended and improved. We are happy to make the current working version available upon request.
References
Albert, R., DasGupta, B., Dondi, R., Sontag, E.: Inferring (biological) signal transduction networks via transitive reductions of directed graphs. Algorithmica 51(2), 129–159 (2008)
Albert, R., DasGupta, B., Sontag, E.: Inference of signal transduction networks from double causal evidence. In: Fenyo, D. (ed.) Methods in Molecular Biology: Topics in Computational Biology. Springer Science+Business Media LLC, New York (2010)
Biocyc pathway/genome database collection (2015)
Blätke, M., Dittrich, A., Rohr, C., Heiner, M., Schaper, F., Marwan, W.: Jak/stat signalling: an executable model assembled from molecule-centred modules demonstrating a module-oriented database concept for systems and synthetic biology. Mol. Biosyst. 9(6), 1290–1307 (2012)
Blinov, M.L., et al.: Pathway commons at virtual cell: use of pathway data for mathematical modeling. Bioinformatics 30(2), 292–294 (2014)
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
DARPA Big Mechanism Project (2015)
Fisher, J., Henzinger, T.A.: Executable cell biology. Nat. Biotechnol. 25(11), 1239–1249 (2007)
Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: ICLP, pp. 579–597 (1990)
Hill, S.M., et al.: Bayesian inference of signaling network topology in a cancer cell line. Bioinformatics 28(21), 2804–2810 (2012)
KEGG: Kyoto encyclopedia of genes and genomes (2015)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge redlvpresentation and reasoning. ACM Trans. Comput. Logic 7, 499–562 (2006)
Lincoln, P.D., Talcott, C.: Symbolic systems biology and pathway logic. In: Iyengar, S. (ed.) Symbolic Systems Biology, pp. 1–29. Jones and Bartlett, Boston (2010)
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theo. Comput. Sci. 96(1), 73–155 (1992)
Meseguer, J.: Twenty years of rewriting logic. J. Logic Algebraic Program. 81(7–8), 721–781 (2012)
Molinelli, E.J., et al.: Perturbation biology: inferring signaling networks in cellular systems. PLoS Comput. Biol. 9(12), e1003290 (2013). PMID: 24367245, PMCID: PMC3868523
Pathway logic (2015)
Protein interaction database (2015)
Reactome pathway database (2015)
Ruths, D.: Deriving Executable Models of Biochemical Network Dynamics from Qualitative Data. Rice University (2009)
Talcott, C., Dill, D.L.: Multiple representations of biological processes. In: Priami, C., Plotkin, G. (eds.) Transactions on Computational Systems Biology VI. LNCS (LNBI), vol. 4220, pp. 221–245. Springer, Heidelberg (2006)
Willemsen, T., Feenstra, K.A., Groth, P.T.: Building executable biological pathway models automatically from BioPAX. In: Linked Science 2013: Supporting Reproducibility, Scientific Investigations and Experiments, pp. 2–14 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Nigam, V., Donaldson, R., Knapp, M., McCarthy, T., Talcott, C. (2015). Inferring Executable Models from Formalized Experimental Evidence. In: Roux, O., Bourdon, J. (eds) Computational Methods in Systems Biology. CMSB 2015. Lecture Notes in Computer Science(), vol 9308. Springer, Cham. https://doi.org/10.1007/978-3-319-23401-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-23401-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23400-7
Online ISBN: 978-3-319-23401-4
eBook Packages: Computer ScienceComputer Science (R0)