BackgroundThis paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks (AN). AN is a general and well-suited formalism to study complex interactions between different components (genes, proteins,...). An attractor is a minimal trap domain, that is, a part of the state-transition graph that cannot be escaped. Such structures are terminal components of the dynamics and take the form of steady states (singleton) or complex compositions of cycles (non-singleton). Studying the effect of a disease or a mutation on an organism requires finding the attractors in the model to understand the long-term behaviors.ResultsWe present a computational logical method based on answer set programming (ASP) to identify all attractors. Performed without any network reduction, the method can be applied on any dynamical semantics. In this paper, we present the two most widespread non-deterministic semantics: the asynchronous and the synchronous updating modes. The logical approach goes through a complete enumeration of the states of the network in order to find the attractors without the necessity to construct the whole state-transition graph. We realize extensive computational experiments which show good performance and fit the expected theoretical results in the literature.ConclusionThe originality of our approach lies on the exhaustive enumeration of all possible (sets of) states verifying the properties of an attractor thanks to the use of ASP. Our method is applied to non-deterministic semantics in two different schemes (asynchronous and synchronous). The merits of our methods are illustrated by applying them to biological examples of various sizes and comparing the results with some existing approaches. It turns out that our approach succeeds to exhaustively enumerate on a desktop computer, in a large model (100 components), all existing attractors up to a given size (20 states). This size is only limited by memory and computation time.

Cellular homeostasis is a continuous phenomenon that if compromised can lead to several disorders including cancer. There is a need to understand the dynamics of cellular proliferation to get deeper insights into the prevalence of cancer. Mechanistic Target of Rapamycin (mTOR) is implicated as the central regulator of the metabolic pathway involved in growth whereas its two distinct complexes mTORC1 and mTORC2 perform particular functions in cellular propagation. To date, mTORC1 is a well defined therapeutic target to inhibit uncontrolled cell division, while the role of mTORC2 is not well characterized. Therefore, the current study is designed to understand the signaling dynamics of mTOR and its partner proteins such as PI3K, PTEN, mTORC2, PKB (Akt), mTORC1, and FOXO. For this purpose, a qualitative model of mTOR-associated Biological Regulatory Network (BRN) is constructed to predict its regulatory behaviors which may not be predictable otherwise. The depleted expression of PTEN and FOXO along with the overexpression of PI3K, mTORC2, mTORC1 and Akt is predicted as a stable steady state which is in accordance with their observed expression levels in the progression of various cancers. The qualitative model also predicts the homeostasis of all the entities in the form of qualitative cycles. The significant qualitative (discrete) cycle is identified by analyzing betweenness centralities of the qualitative (discrete) states. This cycle is further refined as a linear hybrid automaton model with the production (activation) and degradation (inhibition) time delays in order to analyze the real-time constraints for its existence. The analysis of the hybrid model provides a formal proof that during homeostasis the inhibition time delay of Akt is less than the inhibition time delay of mTORC2. In conclusion, our observations characterize that in homeostasis Akt is degraded with a faster rate than mTORC2 which suggests that the inhibition of Akt along with the activation of mTORC2 may be a better therapeutic strategy for the treatment of cancer.

International audienceThe combination of numerous simple influences between the components of a Biological Regulatory Network (BRN) often leads to behaviors that cannot be grasped intuitively. They thus call for the development of proper mathematical methods to delineate their dynamical properties. As a consequence , formal methods and computer tools for the modeling and simulation of BRNs become essential. Our recently introduced discrete formalism called the Process Hitting (PH), a restriction of synchronous automata networks, is notably suitable to such study. In this paper, we propose a new logical approach to perform model-checking of dynamical properties of BRNs modeled in PH. Our work here focuses on state reachability properties on the one hand, and on the identification of fixed points on the other hand. The originality of our model-checking approach relies in the exhaustive enumeration of all possible simulations verifying the dynamical properties thanks to the use of Answer Set Programming

Abstract. The modeling of Biological Regulatory Networks (BRNs) relies on background knowledge, deriving either from literature and/or the analysis of biological observations. But with the development of highthroughput data, there is a growing need for methods that automatically generate admissible models. Our research aim is to provide a logical approach to infer BRNs based on given time series data and known influences amoung genes. In this paper, we propose a new methodology for models expressed through a timed extension of the Automata Networks [22] (well suited for biological systems). The main purpose is to have a resulting network as consistent as possible with the observed datasets. The originality of our work consists in the integration of quantitative time delays directly in our learning approach. We show the benefits of such automatic approach on dynamical biological models, the DREAM4 datasets, a popular reverse-engineering challenge, in order to discuss the precision and the computational performances of our algorithm.