Skip to main content

A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 9957))

Abstract

Dynamic Bayesian Networks (DBNs) have been proposed [16] as an efficient abstraction formalism of biochemical models. They have been shown to approximate well the dynamics of biochemical models, while offering improved efficiency for their analysis [17, 18]. In this paper, we compare different representations and simulation schemes on these DBNs, testing their efficiency and accuracy as abstractions of biological pathways. When generating these DBNs, many configurations are never explored by the underlying dynamics of the biological systems. This can be used to obtain sparse representations to store and analyze DBNs in a compact way. On the other hand, when simulating these DBNs, singular configurations may be encountered, that is configurations from where no transition probability is defined. This makes simulation more complex. We initially evaluate two simple strategies for dealing with singularities: First, re-sampling simulations visiting singular configurations; second filling up uniformly these singular transition probabilities. We show that both these approaches are error prone. Next, we propose a new algorithm which samples only those configurations that avoid singularities by using a look-ahead strategy. Experiments show that this approach is the most accurate while having a reasonable run time.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bertaux, F., Stoma, S., Drasdo, D., Batt, G.: Modeling dynamics of cell-to-cell variability in TRAIL-induced apoptosis explains fractional killing and predicts reversible resistance. PLoS Comput. Biol. 10(10), 14 (2014)

    Article  Google Scholar 

  2. Boyen, X., Koller, D.: Tractable inference for complex stochastic processes. In: UAI-98, pp. 33–42 (1998)

    Google Scholar 

  3. Brown, K.S., Hill, C.C., Calero, G.A., Lee, K.H., Sethna, J.P., Cerione, R.A.: The statistical mechanics of complex signaling networks: nerve growth factor signaling. Phys. Biol. 1, 184–195 (2004)

    Article  Google Scholar 

  4. Calder, M., Vyshemirsky, V., Gilbert, D., Orton, R.J.: Analysis of signalling pathways using continuous time Markov chains. In: Priami, C., Plotkin, G. (eds.) Transactions on Computational Systems Biology VI. LNCS, vol. 4220, pp. 44–67. Springer, Heidelberg (2006). doi:10.1007/11880646_3

    Chapter  Google Scholar 

  5. Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Rule-based modelling of cellular signalling. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 17–41. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Didier, F., Henzinger, T.A., Mateescu, M., Wolf, V.: Approximation of event probabilities in noisy cellular processes. Theor. Comput. Sci. 412, 2128–2141 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Donaldson, R., Gilbert, D.: A model checking approach to the parameter estimation of biochemical pathways. In: Heiner, M., Uhrmacher, A.M. (eds.) CMSB 2008. LNCS (LNBI), vol. 5307, pp. 269–287. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Fages, F., Rizk, A.: On the analysis of numerical data time series in temporal logic. In: Calder, M., Gilmore, S. (eds.) CMSB 2007. LNCS (LNBI), vol. 4695, pp. 48–63. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Grosu, R., Smolka, S.A.: Monte Carlo model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 271–286. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Henzinger, T.A., Mateescu, M., Wolf, V.: Sliding window abstraction for infinite Markov chains. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 337–352. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Jha, S.K., Clarke, E.M., Langmead, C.J., Legay, A., Platzer, A., Zuliani, P.: A Bayesian approach to model checking biological systems. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 218–234. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Koller, D., Friedman, N.: Probabilistic Graphical Models - Principles and Techniques. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  13. Kwiatkowska, M.Z., Norman, G., Parker, D.: Probabilistic model checking for systems biology. Symbolic Systems Biology, Jones and Bartlett (2010)

    Google Scholar 

  14. Kwiatkowska, M., Norman, G., Parker, D.: PRISM: probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200–204. Springer, Heidelberg (2002). doi:10.1007/3-540-46029-2_13

    Chapter  Google Scholar 

  15. Liu, B., Hagiescu, A., Palaniappan, S.K., Chattopadhyay, B., Cui, Z., Wong, W.-F., Thiagarajan, P.S.: Approximate probabilistic analysis of biopathway dynamics. Bioinformatics 28(11), 1508–1516 (2012)

    Article  Google Scholar 

  16. Liu, B., Hsu, D., Thiagarajan, P.S.: Probabilistic approximations of ODEs based bio-pathway dynamics. Theor. Comput. Sci. 412, 2188–2206 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Liu, B., Thiagarajan, P.S., Hsu, D.: Probabilistic approximations of signaling pathway dynamics. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 251–265. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Liu, B., Zhang, J., Tan, P.Y., Hsu, D., Blom, A.M., Leong, B., Sethil, S., Ho, B., Ding, J.L., Thiagarajan, P.S.: A computational, experimental study of the regulatory mechanisms of the complement system. PLoS Comput. Biol. 7(1), e1001059 (2011)

    Article  Google Scholar 

  19. Murphy, K.P., Weiss, Y.: The factored frontier algorithm for approximate inference in DBNs. In: UAI 2001, pp. 378–385 (2001)

    Google Scholar 

  20. Le Novere, N., Bornstein, B., Broicher, A., Courtot, M., Donizelli, M., Dharuri, H., Sauro, H., Li, L., Schilstra, M., Shapiro, B., Snoep, J., Hucka, M.: Biomodels database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems. Nucleic Acids Res. 34, D689–D691 (2006)

    Article  Google Scholar 

  21. Palaniappan, S.K., Akshay, S., Genest, B., Thiagarajan, P.S.: A hybrid factored frontier algorithm. TCBB 9(5), 1352–1365 (2012)

    Google Scholar 

  22. Hlavacek, W.S., Faeder, J.R., Blinov, M.L., Posner, R.G., Hucka, M., Fontana, W.: Rules for modeling signal-transduction systems. Sci. STKE 344, re6 (2006)

    Google Scholar 

Download references

Acknowledgments

This work was partially supported by ANR projects STOCH-MC (ANR-13-BS02-0011-01) and Iceberg (ANR-IABI-3096).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sucheendra K. Palaniappan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Palaniappan, S.K., Pichené, M., Batt, G., Fabre, E., Genest, B. (2016). A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways. In: Cinquemani, E., Donzé, A. (eds) Hybrid Systems Biology. HSB 2016. Lecture Notes in Computer Science(), vol 9957. Springer, Cham. https://doi.org/10.1007/978-3-319-47151-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47151-8_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47150-1

  • Online ISBN: 978-3-319-47151-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics