Revisiting the Training of Logic Models of Protein Signaling Networks with a Formal Approach based on Answer Set Programming

Abstract : A fundamental question in systems biology is the construction and training to data of mathematical models. Logic formalisms have become very popular to model signaling networks because their simplicity allows us to model large systems encompassing hundreds of proteins. An approach to train (Boolean) logic models to high-throughput phospho-proteomics data was recently introduced and solved using optimization heuristics based on stochastic methods. Here we demonstrate how this problem can be solved using Answer Set Programming (ASP), a declarative problem solving paradigm, in which a problem is encoded as a logical program such that its answer sets represent solutions to the problem. ASP has significant improvements over heuristic methods in terms of efficiency and scalability, it guarantees global optimality of solutions as well as provides a complete set of solutions. We illustrate the application of ASP with in silico cases based on realistic networks and data.
Complete list of metadatas

https://hal.inria.fr/hal-00737112
Contributor : Santiago Videla <>
Submitted on : Monday, October 1, 2012 - 3:18:22 PM
Last modification on : Thursday, February 14, 2019 - 11:48:02 AM
Long-term archiving on : Friday, December 16, 2016 - 6:13:30 PM

Files

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Santiago Videla, Carito Guziolowski, Federica Eduati, Sven Thiele, Niels Grabe, et al.. Revisiting the Training of Logic Models of Protein Signaling Networks with a Formal Approach based on Answer Set Programming. CMSB - 10th Computational Methods in Systems Biology 2012, D. Gilbert and M. Heiner, Oct 2012, London, United Kingdom. pp.342-361, ⟨10.1007/978-3-642-33636-2_20⟩. ⟨hal-00737112v1⟩

Share

Metrics

Record views

70

Files downloads

83