Accounting for robustness in modeling signal transduction responses

Abstract

A classical question in systems biology is to find a Boolean model which is able to predict the observed responses of a signaling network. It has been previously shown that such models can be tailored based on experimental data. While fitting a minimum-size network to the experimentally observed data is a natural assumption, it can potentially result in a network which is not so robust against the noises in the training dataset. Indeed, it is widely accepted now that biological systems are generally evolved to be very robust. Therefore, in the present work, we extended the classical formulation of Boolean network construction in order to put weight on the robustness of the created network. We show that our method results generally in more relevant networks. Consequently, considering robustness as a design principle of biological networks can result in more realistic models.     

The complex fluctuations of probabilistic Boolean networks

Probabilistic Boolean networks (PBNs) are extensions of Boolean networks (BNs), and both have been widely used to model biological systems. In this paper, we study the long-range correlations of PBNs based on their corresponding Markov chains. PBN states are quantified by the deviation of their steady-state distributions. The results demonstrate that, compared with BNs, PBNs can exhibit these dynamics over a wider and higher noise range. In addition, the constituent BNs significantly impact the generation of 1/f dynamics of PBNs, and PBNs with homogeneous steady-state distributions tend to sustain the 1/f dynamics over a wider noise range.     

A comprehensive approach to the molecular determinants of lifespan using a Boolean model of geroconversion

Altered molecular responses to insulin and growth factors (GF) are responsible for late‐life shortening diseases such as type‐2 diabetes mellitus (T2DM) and cancers. We have built a network of the signaling pathways that control S‐phase entry and a specific type of senescence called geroconversion. We have translated this network into a Boolean model to study possible cell phenotype outcomes under diverse molecular signaling conditions. In the context of insulin resistance, the model was able to reproduce the variations of the senescence level observed in tissues related to T2DM's main morbidity and mortality. Furthermore, by calibrating the pharmacodynamics of mTOR inhibitors, we have been able to reproduce the dose‐dependent effect of rapamycin on liver degeneration and lifespan expansion in wild‐type and HER2–neu mice. Using the model, we have finally performed an in silico prospective screen of the risk–benefit ratio of rapamycin dosage for healthy lifespan expansion strategies. We present here a comprehensive prognostic and predictive systems biology tool for human aging.     

细胞信号网络功能鲁棒的简并性拓扑特征

细胞信号网络对于外界环境的干扰表现出优良的鲁棒性,但是其维持功能鲁棒的内在机制尚未明确,本文研究了细胞信号网络功能鲁棒性的拓扑特征。选择布尔网络模型模拟细胞网络的动态行为,利用网络节点状态的扰动模拟外界环境干扰。基于演化策略探寻不同网络拓扑的功能并分析其在干扰环境下的鲁棒性,采用埃德尔曼提出的基于信息论的计算方法评估网络拓扑的简并度、冗余度和复杂度等拓扑属性,对比分析它们与功能鲁棒度的相关性及作用机理。结果显示,在网络模型的演化过程中,其拓扑简并度与功能鲁棒度显著正相关,相关性水平高于拓扑冗余度与鲁棒度的相关性。并且,随着鲁棒度的提升,网络的节点数和复杂度也随之升高,同样简并度与网络的节点数和复杂度的相关性高于拓扑冗余度与网络的节点数和复杂度的相关性。这说明增加的网络节点以简并的方式同时提高了网络拓扑的鲁棒度和复杂度。因此,细胞网络功能鲁棒性的拓扑特征是简并而不是冗余,简并为解决生物系统的复杂问题提供了有效手段,为人工系统的可靠性设计提供有益的借鉴。     

Modelling gene networks at different organisational levels

Approaches to modelling gene regulation networks can be categorized, according to increasing detail, as network parts lists, network topology models, network control logic models, or dynamic models. We discuss the current state of the art for each of these approaches. There is a gap between the parts list and topology models on one hand, and control logic and dynamic models on the other hand. The first two classes of models have reached a genome-wide scale, while for the other model classes high throughput technologies are yet to make a major impact.     

Dynamical properties of model gene networks and implications for the inverse problem

We study the inverse problem, or the "reverse-engineering" problem, for two abstract models of gene expression dynamics, discrete-time Boolean networks and continuous-time switching networks. Formally, the inverse problem is similar for both types of networks. For each gene, its regulators and its Boolean dynamics function must be identified. However, differences in the dynamical properties of these two types of networks affect the amount of data that is necessary for solving the inverse problem. We derive estimates for the average amounts of time series data required to solve the inverse problem for randomly generated Boolean and continuous-time switching networks. We also derive a lower bound on the amount of data needed that holds for both types of networks. We find that the amount of data required is logarithmic in the number of genes for Boolean networks, matching the general lower bound and previous theory, but are superlinear in the number of genes for continuous-time switching networks. We also find that the amount of data needed scales as 2(K), where K is the number of regulators per gene, rather than 2(2K), as previous theory suggests.     

Systems pharmacology and enhanced pharmacodynamic models for understanding antibody-based drug action and toxicity

Pharmacokinetic (PK) and pharmacodynamic (PD) models seek to describe the temporal pattern of drug exposures and their associated pharmacological effects produced at micro- and macro-scales of organization. Antibody-based drugs have been developed for a large variety of diseases, with effects exhibited through a comprehensive range of mechanisms of action. Mechanism-based PK/PD and systems pharmacology models can play a major role in elucidating and integrating complex antibody pharmacological properties, such as nonlinear disposition and dynamical intracellular signaling pathways triggered by ligation to their cognate targets. Such complexities can be addressed through the use of robust computational modeling techniques that have proven powerful tools for pragmatic characterization of experimental data and for theoretical exploration of antibody efficacy and adverse effects. The primary objectives of such multi-scale mathematical models are to generate and test competing hypotheses and to predict clinical outcomes. In this review, relevant systems pharmacology and enhanced PD (ePD) models that are used as predictive tools for antibody-based drug action are reported. Their common conceptual features are highlighted, along with approaches used for modeling preclinical and clinically available data. Key examples illustrate how systems pharmacology and ePD models codify the interplay among complex biology, drug concentrations, and pharmacological effects. New hybrid modeling concepts that bridge cutting-edge systems pharmacology models with established PK/ePD models will be needed to anticipate antibody effects on disease in subpopulations and individual patients.     

Neutral space analysis for a Boolean network model of the fission yeast cell cycle network

Background

Interactions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN) that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast) cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle.

Results

Through simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G₁ fixed point was found for deterministic updating schemes.

Conclusions

In general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the wildtype network connected component.     

An in silico target identification using Boolean network attractors: Avoiding pathological phenotypes

Target identification aims at identifying biomolecules whose function should be therapeutically altered to cure the considered pathology. An algorithm for in silico target identification using Boolean network attractors is proposed. It assumes that attractors correspond to phenotypes produced by the modeled biological network. It identifies target combinations which allow disturbed networks to avoid attractors associated with pathological phenotypes. The algorithm is tested on a Boolean model of the mammalian cell cycle and its applications are illustrated on a Boolean model of Fanconi anemia. Results show that the algorithm returns target combinations able to remove attractors associated with pathological phenotypes and then succeeds in performing the proposed in silico target identification. However, as with any in silico evidence, there is a bridge to cross between theory and practice. Nevertheless, it is expected that the algorithm is of interest for target identification.