Skip to main content

Identification of Transition Models of Biological Systems in the Presence of Transition Noise

  • Conference paper
  • First Online:
Inductive Logic Programming (ILP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9575))

Included in the following conference series:

  • 482 Accesses

Abstract

The identification of transition models of biological systems (Petri net models, for example) in noisy environments has not been examined to any significant extent, although they have been used to model the ideal behaviour of metabolic, signalling and genetic networks. Progress has been made in identifying such models from sequences of qualitative states of the system; and, more recently, with additional logical constraints as background knowledge. Both forms of model identification assume the data are correct, which is often unrealistic since biological systems are inherently stochastic. In this paper, we model the transition noise that can affect model identification as a Markov process where the corresponding transition functions are assumed to be known. We investigate, in the presence of this transition noise, the identification of transitions in a target model. The experiments are re-constructions of known networks from simulated data with varying amounts of transition-noise added. In each case, the target model traces a specific trajectory through the state-space. Model structures that explain the noisy state-sequences are obtained based on recent work which formulates the identification of transition models as logical consequence-finding. With noisy data, we need to extend this formulation by allowing the abduction of new transitions. The resulting structures may be both incorrect and incomplete with respect to the target model. We quantify the ability to identify the transitions in the target model, using probability estimates computed from transition-sequences using PRISM. Empirical results suggest that we are able to identify correctly the transitions in the target model with transition noise levels ranging from low to high values.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Notes

  1. 1.

    This may be slightly confusing in the first instance, since in HMMs, states are hidden. Here we are referring to biological system states and biological system transitions.

References

  1. Van Der Aalst, W.: Process mining: overview and opportunities. ACM Trans. Manage. Inf. Syst. 3(2), 7 (2012)

    Google Scholar 

  2. Bellodi, E., Riguzzi, F., Lamma, E.: Probabilistic declarative process mining. In: Bi, Y., Williams, M.-A. (eds.) KSEM 2010. LNCS, vol. 6291, pp. 292–303. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. David, R., Alla, H.: Discrete, Continuous, and Hybrid Petri Nets, 2nd edn. Springer, Berlin (2010)

    Book  MATH  Google Scholar 

  4. Durzinsky, M., Wagler, A., Marwan, W.: Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks. BMC Syst. Biol. 5, 113 (2011)

    Article  Google Scholar 

  5. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures: Part II: state spaces of concurrent systems. Acta informatica 27, 343–368 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Elowitz, M., Levine, A., Siggia, E., Swain, P.: Stochastic gene expression in a single cell. Science 297, 1183–1186 (2002)

    Article  Google Scholar 

  7. Ferilli, S., Esposito, F.: A logic framework for incremental learning of process models. Fundamenta Informaticae 128, 1–31 (2013)

    MathSciNet  MATH  Google Scholar 

  8. Gillespie, D.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340–2361 (1977)

    Article  Google Scholar 

  9. Inoue, K., Ribeiro, T., Sakama, C.: Learning from interpretation transition. Mach. Learn. 94(1), 51–79 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Keller, R.: Formal verification of parallel programs. Commun. ACM 19(7), 371–384 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kindler, E., Rubin, V., Schäfer, W.: Process mining and petri net synthesis. In: Eder, J., Dustdar, S. (eds.) BPM Workshops 2006. LNCS, vol. 4103, pp. 105–116. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Lamma, E., Mello, P., Riguzzi, F., Storari, S.: Applying inductive logic programming to process mining. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 132–146. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Mayo, M.: Learning petri net models of non-linear gene interactions. Biosystems 82(1), 74–82 (2005)

    Article  MathSciNet  Google Scholar 

  14. Moore, J., Boczko, E., Summar, M.: Connecting the dots between genes, biochemistry, and disease susceptibility: systems biology modeling in human genetics. Mol. Genet. Metab. 84, 104–111 (2005)

    Article  Google Scholar 

  15. Sato, T., Kameya, Y.: PRISM: A symbolic-statistical modeling language. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1330–1335 (1997)

    Google Scholar 

  16. Srinivasan, A., Bain, M.: Knowledge-guided identification of petri net models of large biological systems. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS, vol. 7207, pp. 317–331. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Srinivasan, A., Bain, M.: Identification of Transition-Based Models of Biological Systems using Logic Programming. Technical report UNSW-CSE-TR-201425, School of Computer Science and Engineering, University of New South Wales, Sydney, Australia, December 2014

    Google Scholar 

  18. Yamamoto, A.: Representing inductive inference with SOLD-resolution. In: Proceedings of the IJCAI 1997 Workshop on Abduction and Induction in AI (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Bain .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Srinivasan, A., Bain, M., Vatsa, D., Agarwal, S. (2016). Identification of Transition Models of Biological Systems in the Presence of Transition Noise. In: Inoue, K., Ohwada, H., Yamamoto, A. (eds) Inductive Logic Programming. ILP 2015. Lecture Notes in Computer Science(), vol 9575. Springer, Cham. https://doi.org/10.1007/978-3-319-40566-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40566-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40565-0

  • Online ISBN: 978-3-319-40566-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics