Gene network inference from single-cell omics data and domain knowledge for constructing COVID-19-specific ICAM1-associated pathways.

Introduction: Intercellular adhesion molecule 1 (ICAM-1) is a critical molecule responsible for interactions between cells. Previous studies have suggested that ICAM-1 triggers cell-to-cell transmission of HIV-1 or HTLV-1, that SARS-CoV-2 shares several features with these viruses via interactions between cells, and that SARS-CoV-2 cell-to-cell transmission is associated with COVID-19 severity. From these previous arguments, it is assumed that ICAM-1 can be related to SARS-CoV-2 cell-to-cell transmission in COVID-19 patients. Indeed, the time-dependent change of the ICAM-1 expression level has been detected in COVID-19 patients. However, signaling pathways that consist of ICAM-1 and other molecules interacting with ICAM-1 are not identified in COVID-19. For example, the current COVID-19 Disease Map has no entry for those pathways. Therefore, discovering unknown ICAM1-associated pathways will be indispensable for clarifying the mechanism of COVID-19. Materials and methods: This study builds ICAM1-associated pathways by gene network inference from single-cell omics data and multiple knowledge bases. First, single-cell omics data analysis extracts coexpressed genes with significant differences in expression levels with spurious correlations removed. Second, knowledge bases validate the models. Finally, mapping the models onto existing pathways identifies new ICAM1-associated pathways. Results: Comparison of the obtained pathways between different cell types and time points reproduces the known pathways and indicates the following two unknown pathways: (1) upstream pathway that includes proteins in the non-canonical NF-κB pathway and (2) downstream pathway that contains integrins and cytoskeleton or motor proteins for cell transformation. Discussion: In this way, data-driven and knowledge-based approaches are integrated into gene network inference for ICAM1-associated pathway construction. The results can contribute to repairing and completing the COVID-19 Disease Map, thereby improving our understanding of the mechanism of COVID-19.

Incorporating Time Delays in Process Hitting Framework for Dynamical Modeling of Large Biological Regulatory Networks.

Modeling and simulation of molecular systems helps in understanding the behavioral mechanism of biological regulation. Time delays in production and degradation of expressions are important parameters in biological regulation. Constraints on time delays provide insight into the dynamical behavior of a Biological Regulatory Network (BRN). A recently introduced Process Hitting (PH) Framework has been found efficient in static analysis of large BRNs, however, it lacks the inference of time delays and thus determination of their constraints associated with the evolution of the expression levels of biological entities of BRN is not possible. In this paper we propose a Hybrid Process Hitting scheme for introducing time delays in Process Hitting Framework for dynamical modeling and analysis of Large Biological Regulatory Networks. It provides valuable insights into the time delays corresponding to the changes in the expression levels of biological entities thus possibly helping in identification of therapeutic targets. The proposed framework is applied to a well-known BRNs of Bacteriophage λ and ERBB Receptor-regulated G1/S transition involved in the breast cancer to demonstrate the viability of our approach. Using the proposed approach, we are able to perform goal-oriented reduction of the BRN and also determine the constraints on time delays characterizing the evolution (dynamics) of the reduced BRN.

ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks.

BACKGROUND: This 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. RESULTS: We 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. CONCLUSION: The 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.

Analyzing resilience properties in oscillatory biological systems using parametric model checking.

Automated verification of living organism models allows us to gain previously unknown knowledge about underlying biological processes. In this paper we show how parametric time model checking can be applied to define the time behavior of biological oscillatory systems more precisely. In particular, we focus on the resilience properties of such systems. This notion was introduced to understand the behavior of biological systems (e.g. the mammalian circadian rhythm) that are reactive and adaptive enough to endorse major changes in their environment (e.g. jet-lags, day-night alternating work-time). We formalize these properties through parametric TCTL and investigate the influence of environmental conditions changes on the resilience of living organisms under the uncertainty in parameters. In particular, we discuss the influence of various perturbations, e.g. artificial jet-lag or components knock-out on the parameters controlling the oscillatory behavior. This analysis is crucial when it comes to model elicitation for dynamic biological systems. We demonstrate the applicability of this technique using a simplified model of circadian clock and discuss its results with regard to other previous studies based on hybrid modeling.

Learning delayed influences of biological systems.

Boolean networks are widely used model to represent gene interactions and global dynamical behavior of gene regulatory networks. To understand the memory effect involved in some interactions between biological components, it is necessary to include delayed influences in the model. In this paper, we present a logical method to learn such models from sequences of gene expression data. This method analyzes each sequence one by one to iteratively construct a Boolean network that captures the dynamics of these observations. To illustrate the merits of this approach, we apply it to learning real data from bioinformatic literature. Using data from the yeast cell cycle, we give experimental results and show the scalability of the method. We show empirically that using this method we can handle millions of observations and successfully capture delayed influences of Boolean networks.