Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

Abstract : MOTIVATION: Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however, is essential to provide precise insight in the mechanisms underlaying signal transduction and generate reliable predictions. RESULTS: We propose the use of Answer Set Programming to explore exhaustively the space of feasible logic models. Toward this end, we have developed caspo, an open-source Python package that provides a powerful platform to learn and characterize logic models by leveraging the rich modeling language and solving technologies of Answer Set Programming. We illustrate the usefulness of caspo by revisiting a model of pro-growth and inflammatory pathways in liver cells. We show that, if experimental error is taken into account, there are thousands (11 700) of models compatible with the data. Despite the large number, we can extract structural features from the models, such as links that are always (or never) present or modules that appear in a mutual exclusive fashion. To further characterize this family of models, we investigate the input-output behavior of the models. We find 91 behaviors across the 11 700 models and we suggest new experiments to discriminate among them. Our results underscore the importance of characterizing in a global and exhaustive manner the family of feasible models, with important implications for experimental design. AVAILABILITY: caspo is freely available for download (license GPLv3) and as a web service at http://caspo.genouest.org/. SUPPLEMENTARY INFORMATION: Supplementary materials are available at Bioinformatics online. CONTACT: santiago.videla@irisa.fr.
Type de document :
Article dans une revue
Bioinformatics, Oxford University Press (OUP), 2013, 29 (18), pp.2320-2326. 〈10.1093/bioinformatics/btt393〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00853704
Contributeur : Anne Siegel <>
Soumis le : vendredi 23 août 2013 - 12:06:20
Dernière modification le : mardi 16 janvier 2018 - 15:54:19

Identifiants

Citation

Carito Guziolowski, Santiago Videla, Federica Eduati, Sven Thiele, Thomas Cokelaer, et al.. Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming. Bioinformatics, Oxford University Press (OUP), 2013, 29 (18), pp.2320-2326. 〈10.1093/bioinformatics/btt393〉. 〈hal-00853704〉

Partager

Métriques

Consultations de la notice

433