Skip to main content

Model Revision of Boolean Regulatory Networks at Stable State

  • Conference paper
  • First Online:
Bioinformatics Research and Applications (ISBRA 2019)

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

Included in the following conference series:

Abstract

Models of biological regulatory networks are essential to understand the cellular processes. However, the definition of such models is still mostly manually performed, and consequently prone to error. Moreover, as new experimental data is acquired, models need to be revised and updated. Here, we propose a model revision tool, capable of proposing the set of minimum repairs to render a model consistent with a set of experimental observations. We consider four possible repair operations, giving preference to function repairs over topological ones. Also, we consider observations at stable state, i.e., we do not consider the model dynamics. We evaluate our tool on five known logical models. We perform random changes considering several parameter configurations to assess the tool repairing capabilities. Whenever a model is repaired under the time limit, the tool successfully produces the optimal solutions to repair the model. Also, the number of repair operations required is less than or equal to the number of random changes applied to the original model.

Fundação para a Ciência e a Tecnologia PhD grant SFRH/BD/130253/2017, national funds UID/CEC/50021/2019, grant SFRH/BSAB/143643/2019 and project grant PTDC/EEI-CTP/2914/2014.

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.

    Tool available at http://sat.inesc-id.pt/~joaofrg/ISBRA2019/model_revision.zip.

References

  1. Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability, vol. 185. IOS Press, Amsterdam (2009)

    MATH  Google Scholar 

  2. Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications. Cambridge University Press, Cambridge (2011)

    Book  Google Scholar 

  3. Cury, J.E., Monteiro, P.T., Chaouiya, C.: Partial Order on the set of Boolean Regulatory Functions. arXiv preprint arXiv:1901.07623 (2019)

  4. Davidich, M.I., Bornholdt, S.: Boolean network model predicts cell cycle sequence of fission yeast. PLoS ONE 3(2), e1672 (2008)

    Article  Google Scholar 

  5. Fauré, A., Naldi, A., Chaouiya, C., Thieffry, D.: Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle. Bioinformatics 22(14), e124–e131 (2006)

    Article  Google Scholar 

  6. Gebser, M., et al.: Repair and prediction (under inconsistency) in large biological networks with answer set programming. In: KR (2010)

    Google Scholar 

  7. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer set solving in practice. Synth. Lect. Artif. Intell. Mach. Learn. 6(3), 1–238 (2012)

    Article  Google Scholar 

  8. Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. TPLP 11(2–3), 323–360 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Gouveia, F., Lynce, I., Monteiro, P.T.: Model revision of logical regulatory networks using logic-based tools. In: ICLP 2018 (Technical Communications). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)

    Google Scholar 

  10. Guerra, J., Lynce, I.: Reasoning over biological networks using maximum satisfiability. In: Milano, M. (ed.) CP 2012. LNCS, pp. 941–956. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33558-7_67

    Chapter  Google Scholar 

  11. Hopfensitz, M., Müssel, C., Maucher, M., Kestler, H.A.: Attractors in Boolean networks: a tutorial. Comput. Stat. 28(1), 19–36 (2012)

    Article  MathSciNet  Google Scholar 

  12. Karlebach, G., Shamir, R.: Modelling and analysis of gene regulatory networks. Nat. Rev. Mol. Cell Biol. 9(10), 770 (2008)

    Article  Google Scholar 

  13. Klamt, S., Saez-Rodriguez, J., Lindquist, J.A., Simeoni, L., Gilles, E.D.: A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinform. 7(1), 56 (2006)

    Article  Google Scholar 

  14. Mendoza, L., Xenarios, I.: A method for the generation of standardized qualitative dynamical systems of regulatory networks. Theor. Biol. Med. Model. 3(1), 13 (2006)

    Article  Google Scholar 

  15. Merhej, E., Schockaert, S., De Cock, M.: Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study. Int. J. Approx. Reason. 83, 243–264 (2017)

    Article  MathSciNet  Google Scholar 

  16. Monteiro, P.T., Ropers, D., Mateescu, R., Freitas, A.T., De Jong, H.: Temporal logic patterns for querying dynamic models of cellular interaction networks. Bioinformatics 24(16), i227–i233 (2008)

    Article  Google Scholar 

  17. Naldi, A., Remy, E., Thieffry, D., Chaouiya, C.: Dynamically consistent reduction of logical regulatory graphs. Theor. Comput. Sci. 412(21), 2207–2218 (2011)

    Article  MathSciNet  Google Scholar 

  18. Paulevé, L.: Reduction of qualitative models of biological networks for transient dynamics analysis. IEEE/ACM Trans. Comput. Biol. Bioinform. 15, 1167–1179 (2017)

    Article  Google Scholar 

  19. Sánchez, L., Chaouiya, C., Thieffry, D.: Segmenting the fly embryo: logical analysis of the role of the segment polarity cross-regulatory module. Int. J. Dev. Biol. 52(8), 1059–1075 (2002)

    Article  Google Scholar 

  20. Thomas, R.: Boolean formalization of genetic control circuits. J. Theor. Biol. 42(3), 563–585 (1973)

    Article  Google Scholar 

  21. Wegner, I.: The critical complexity of all (monotone) Boolean functions and monotone graph properties. Inf. Control. 67(1–3), 212–222 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Filipe Gouveia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gouveia, F., Lynce, I., Monteiro, P.T. (2019). Model Revision of Boolean Regulatory Networks at Stable State. In: Cai, Z., Skums, P., Li, M. (eds) Bioinformatics Research and Applications. ISBRA 2019. Lecture Notes in Computer Science(), vol 11490. Springer, Cham. https://doi.org/10.1007/978-3-030-20242-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20242-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-20241-5

  • Online ISBN: 978-3-030-20242-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics