Abstract
Rule-based modelling allows very compact descriptions of protein-protein interaction networks. However, combinatorial complexity increases again when one attempts to describe formally the behaviour of the networks, which motivates the use of abstractions to make these models more coarse-grained.
Context-insensitive abstractions of the intrinsic flow of information among the sites of chemical complexes through the rules have been proposed to infer sound coarse-graining, providing an efficient way to find macro-variables and the corresponding reduced models. In this paper, we propose a framework to allow the tuning of the context-sensitivity of the information flow analyses and show how these finer analyses can be used to find fewer macro-variables and smaller reduced differential models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blinov, M.L., Faeder, J.R., Goldstein, B., Hlavacek, W.S.: Bionetgen: software for rule-based modeling of signal transduction based on the interactions of molecular domains. Bioinformatics 20(17), 3289–3291 (2004)
Bor-Yuh, E.C., Rival, X.: Relational inductive shape analysis. In: Necula, G.C., Wadler, P. (eds.) POPL, pp. 247–260. ACM (2008)
Borisov, N.M., Markevich, N.I., Kholodenko, B.N., Dieter Gilles, E.: Signaling through receptors and scaffolds: Independent interactions reduce combinatorial complexity. Biophysical Journal 89 (2005)
Bourdoncle, F.: Abstract interpretation by dynamic partitioning. J. Funct. Program. 2(4), 407–423 (1992)
Camporesi, F., Feret, J.: Formal reduction for rule-based models. In: Mislove, M., Ouaknine, J. (eds.) MFPS, Pittsburgh, USA. ENTCS, vol. 276, pp. 29–59. Elsevier (September 2011)
Camporesi, F., Feret, J., Koeppl, H., Petrov, T.: Combining Model Reductions. In: Mislove, M., Selinger, P. (eds.) MFPS, Ottawa, Canada. ENTCS, vol. 265, pp. 73–96. Elsevier (September 2010)
Conzelmann, H., Saez-Rodriguez, J., Sauter, T., Kholodenko, B.N., Gilles, E.D.: A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks. BMC Bioinformatics 7 (2006)
Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) POPL, pp. 238–252. ACM (1977)
Cousot, P., Cousot, R.: Constructive versions of Tarski’s fixed point theorems. Pacific Journal of Mathematics 81(1), 43–57 (1979)
Danos, V., Feret, J., Fontana, W., Harmer, R., Hayman, J., Krivine, J., Thompson-Walsh, C., Winskel, G.: Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models. In: D’Souza, D., Radhakrishnan, J., Telikepalli, K. (eds.) FSTTCS, Hyderabad, India, vol. 18. IARCS, LIPIcs (2012)
Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Rule-based modelling, symmetries, refinements. In: Fisher, J. (ed.) FMSB 2008. LNCS (LNBI), vol. 5054, pp. 103–122. Springer, Heidelberg (2008)
Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Abstracting the differential semantics of rule-based models: exact and automated model reduction. In: LICS, Edinburgh, GB, pp. 362–381. IEEE Computer Society (2010)
Danos, V., Laneve, C.: Formal molecular biology. TCS 325(1), 69–110 (2004)
Feret, J., Danos, V., Krivine, J., Harmer, R., Fontana, W.: Internal coarse-graining of molecular systems. PNAS 106(16) (April 2009)
Feret, J., Henzinger, T., Koeppl, H., Petrov, T.: Lumpability Abstractions of Rule-based Systems. TCS 431, 137–164 (2012)
Feret, J., Koeppl, H., Petrov, T.: Stochastic fragments: A framework for the exact reduction of the stochastic semantics of rule-based models. IJSI (to appear)
Harmer, R., Danos, V., Feret, J., Krivine, J., Fontana, W.: Intrinsic Information carriers in combinatorial dynamical systems. Chaos 20(3), 037108 (2010)
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55–74. IEEE Computer Society (2002)
Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: Appel, A.W., Aiken, A. (eds.) POPL, pp. 105–118. ACM (1999)
Ward, M.: The closure operators of a lattice. Annals Math. 42, 191–196 (1942)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Camporesi, F., Feret, J., Hayman, J. (2013). Context-Sensitive Flow Analyses: A Hierarchy of Model Reductions. In: Gupta, A., Henzinger, T.A. (eds) Computational Methods in Systems Biology. CMSB 2013. Lecture Notes in Computer Science(), vol 8130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40708-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-40708-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40707-9
Online ISBN: 978-3-642-40708-6
eBook Packages: Computer ScienceComputer Science (R0)