Abstract
Biological regulatory networks can be represented by computational models, which allow the study and the analysis of biological behaviours, therefore providing a better understanding of a given biological process. However, as new information is acquired, biological models may need to be revised, in order to also account for this new information. Here, we present a model revision tool, capable of repairing inconsistent Boolean biological models. Moreover, the tool is able to confront the models, both with steady state observations, as well as time-series data, considering both synchronous and asynchronous update schemes. The tool was tested with a well-known biological model that was corrupted with different random changes. The presented tool was able to successfully repair the majority of the corrupted models.
This work was supported by national funds through Fundação para a Ciência e a Tecnologia (FCT) with reference SFRH/BD/130253/2017 (PhD grant) and UIDB/50021/2020 (INESC-ID multi-annual funding).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications. Cambridge University Press, Cambridge (2011)
De Jong, H.: Modeling and simulation of genetic regulatory systems: a literature review. J. Comput. Biol. 9(1), 67–103 (2002)
Gebser, M., et al.: Repair and prediction (under inconsistency) in large biological networks with answer set programming. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010. AAAI Press (2010)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer set solving in practice. In: Synthesis Lectures on Artificial Intelligence and Machine Learning, vol. 6, no. 3, pp. 1–238 (2012)
Gouveia, F., Lynce, I., Monteiro, P.T.: Revision of Boolean models of regulatory networks using stable state observations. J. Comput. Biol. 27(2), 144–155 (2020)
Gouveia, F., Lynce, I., Monteiro, P.T.: Semi-automatic model revision of Boolean regulatory networks: confronting time-series observations with (a)synchronous dynamics. bioRxiv preprint (2020) https://doi.org/10.1101/2020.05.10.086900
Karlebach, G., Shamir, R.: Modelling and analysis of gene regulatory networks. Nat. Rev. Mol. Cell Biol. 9(10), 770 (2008)
Lemos, A., Lynce, I., Monteiro, P.T.: Repairing Boolean logical models from time-series data using Answer Set Programming. Algorithms Molecular Biol. 14(1), 9 (2019)
Merhej, E., Schockaert, S., Cock, M.D.: Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study. Int. J. Approximate Reason. 83, 243–264 (2017)
Mobilia, N., Rocca, A., Chorlton, S., Fanchon, E., Trilling, L.: Logical modeling and analysis of regulatory genetic networks in a non monotonic framework. In: Ortuño, F., Rojas, I. (eds.) IWBBIO 2015. LNCS, vol. 9043, pp. 599–612. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-16483-0_58
Naldi, A.: BioLQM: A java toolkit for the manipulation and conversion of logical qualitative models of biological networks. Front. Physiol. 9 (2018)
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)
Siegel, A., Radulescu, O., Le Borgne, M., Veber, P., Ouy, J., Lagarrigue, S.: Qualitative analysis of the relation between DNA microarray data and behavioral models of regulation networks. Biosystems 84(2), 153–174 (2006)
Thomas, R.: Boolean formalization of genetic control circuits. J. Theor. Biol. 42(3), 563–585 (1973)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Tutorial
A Tutorial
The model shown in Fig. 1 is represented by the following listing:
Now let us consider that we want to define a steady state observation in which \(v_1\) has value 0, \(v_2\) has value 0, and \(v_3\) has value 1, as following:
Using ModRev tool, giving the model defined above (as a file model.lp) and the steady state (as a file obsSS.lp), execute the following command:
This output means that the model in Fig. 1 can be repaired by changing the interaction type between \(v_1\) and \(v_3\). If we repair the model and execute the above command again, the result will be:
Now let us assume that the user knows that the interaction between \(v_1\) and \(v_3\) is correct, and wants to prevent repairs over it. The predicate fixed(v1,v3). can be used to define that the edge between these nodes can not be changed or removed. Adding this predicate to the model and running the command above, we obtain the following result:
A different set of repair operations is obtained that does not change the fixed edge. Now assume that the user wants to prevent any repair over the node \(v_3\). The predicate fixed(v3). can be used to prevent that node to be inconsistent. However, in this example, if we prevent any change to node \(v_3\), considering its regulatory function, and that \(v_1\) has value 0 and \(v_3\) has value 1, and we are in the presence of a steady state, it becomes impossible to repair the network. In this case, when the model is over-constrained, using the same command as before, the tool produces the following message:
Consider now that we have, for the same model in Fig. 1, a time-series data as shown in Table 2. Consider that this experimental observation with three time-steps (0, 1 and 2) is considering a synchronous update scheme.
We can represent the time-series data using the following listing:
Note that we start the file indicating the maximum value of time step with #const t = 2.
Using ModRev to verify whether the model is consistent, while considering the above time-series data (as a file obsTS01.lp) under a synchronous update scheme, execute the following command:
This will produce the following result:
Note that now we have multiple choices to render the model consistent. To repair node \(v_2\), for example, one can apply the operations in Repair #1 or in Repair #2. The same applies to repair node \(v_3\).
If instead of a time-series data under a synchronous update scheme, we are under an asynchronous update scheme, the previous command would change from -up s to -up a. The option -up indicates the update scheme to be considered, with argument s for synchronous and a for asynchronous.
ModRev also supports incomplete time-series data. Assume that we have the experimental observation shown in Table 3, where node \(v_3\) was not observed, and a value of \(v_1\) was also not observed.
Consider the following representation of an incomplete time-series data:
Executing the following command, while considering the above experimental observation (as a file obsTS02.lp) under synchronous update scheme, produces the result below.
ModRev tool also supports confronting a model with multiple experimental observations at the same time. For example, we could confront the model of Fig. 1 with the two time-series data above, using the command:
Note that the directive #const t = 2 must only be defined once.
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Gouveia, F., Lynce, I., Monteiro, P.T. (2020). ModRev - Model Revision Tool for Boolean Logical Models of Biological Regulatory Networks. In: Abate, A., Petrov, T., Wolf, V. (eds) Computational Methods in Systems Biology. CMSB 2020. Lecture Notes in Computer Science(), vol 12314. Springer, Cham. https://doi.org/10.1007/978-3-030-60327-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-60327-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-60326-7
Online ISBN: 978-3-030-60327-4
eBook Packages: Computer ScienceComputer Science (R0)