An analysis of the class of gene regulatory functions implied by a biochemical model

Understanding the integrated behavior of genetic regulatory networks, in which genes regulate one another's activities via RNA and protein products, is emerging as a dominant problem in systems biology. One widely studied class of models of such networks includes genes whose expression values assume Boolean values (i.e., on or off). Design decisions in the development of Boolean network models of gene regulatory systems include the topology of the network (including the distribution of input- and output-connectivity) and the class of Boolean functions used by each gene (e.g., canalizing functions, post functions, etc.). For example, evidence from simulations suggests that biologically realistic dynamics can be produced by scale-free network topologies with canalizing Boolean functions. This work seeks further insights into the design of Boolean network models through the construction and analysis of a class of models that include more concrete biochemical mechanisms than the usual abstract model, including genes and gene products, dimerization, cis-binding sites, promoters and repressors. In this model, it is assumed that the system consists of N genes, with each gene producing one protein product. Proteins may form complexes such as dimers, trimers, etc. The model also includes cis-binding sites to which proteins may bind to form activators or repressors. Binding affinities are based on structural complementarity between proteins and binding sites, with molecular binding sites modeled by bit-strings. Biochemically plausible gene expression rules are used to derive a Boolean regulatory function for each gene in the system. The result is a network model in which both topological features and Boolean functions arise as emergent properties of the interactions of components at the biochemical level. A highly biased set of Boolean functions is observed in simulations of networks of various sizes, suggesting a new characterization of the subset of Boolean functions that are likely to appear in gene regulatory networks.     

Biologically meaningful update rules increase the critical connectivity of generalized Kauffman networks

We generalize random Boolean networks by softening the hard binary discretization into multiple discrete states. These multistate networks are generic models of gene regulatory networks, where each gene is known to assume a finite number of functionally different expression levels. We analytically determine the critical connectivity that separates the biologically unfavorable frozen and chaotic regimes. This connectivity is inversely proportional to a parameter which measures the heterogeneity of the update rules. Interestingly, the latter does not necessarily increase with the mean number of discrete states per node. Still, allowing for multiple states decreases the critical connectivity as compared to random Boolean networks, and thus leads to biologically unrealistic situations.Therefore, we study two approaches to increase the critical connectivity. First, we demonstrate that each network can be kept in its frozen regime by sufficiently biasing the update rules. Second, we restrict the randomly chosen update rules to a subclass of biologically more meaningful functions. These functions are characterized based on a thermodynamic model of gene regulation. We analytically show that their usage indeed increases the critical connectivity. From a general point of view, our thermodynamic considerations link discrete and continuous models of gene regulatory networks.     

Maximum Number of Fixed Points in Regulatory Boolean Networks

Boolean networks (BNs) have been extensively used as mathematical models of genetic regulatory networks. The number of fixed points of a BN is a key feature of its dynamical behavior. Here, we study the maximum number of fixed points in a particular class of BNs called regulatory Boolean networks, where each interaction between the elements of the network is either an activation or an inhibition. We find relationships between the positive and negative cycles of the interaction graph and the number of fixed points of the network. As our main result, we exhibit an upper bound for the number of fixed points in terms of minimum cardinality of a set of vertices meeting all positive cycles of the network, which can be applied in the design of genetic regulatory networks.     

Detecting controlling nodes of boolean regulatory networks

Boolean models of regulatory networks are assumed to be tolerant to perturbations. That qualitatively implies that each function can only depend on a few nodes. Biologically motivated constraints further show that functions found in Boolean regulatory networks belong to certain classes of functions, for example, the unate functions. It turns out that these classes have specific properties in the Fourier domain. That motivates us to study the problem of detecting controlling nodes in classes of Boolean networks using spectral techniques. We consider networks with unbalanced functions and functions of an average sensitivity less than ?k, where k is the number of controlling variables for a function. Further, we consider the class of 1-low networks which include unate networks, linear threshold networks, and networks with nested canalyzing functions. We show that the application of spectral learning algorithms leads to both better time and sample complexity for the detection of controlling nodes compared with algorithms based on exhaustive search. For a particular algorithm, we state analytical upper bounds on the number of samples needed to find the controlling nodes of the Boolean functions. Further, improved algorithms for detecting controlling nodes in large-scale unate networks are given and numerically studied.     

Perturbation avalanches and criticality in gene regulatory networks

Boolean networks are simplified models of gene regulatory networks. We derive an approximation of the size distribution of perturbation avalanches in Boolean networks based on known results in the theory of branching processes. We show numerically that the approximation works well for different kinds of Boolean networks. It has been suggested that gene regulatory networks may be dynamically critical. To study this, as an application of the presented theory we present a novel method for estimating an order parameter from microarray data. According to the available data and our method, we find that gene regulatory networks appear to be stable and reside near the phase transition between order and chaos.     

On the long-run sensitivity of probabilistic Boolean networks

Boolean networks and, more generally, probabilistic Boolean networks, as one class of gene regulatory networks, model biological processes with the network dynamics determined by the logic-rule regulatory functions in conjunction with probabilistic parameters involved in network transitions. While there has been significant research on applying different control policies to alter network dynamics as future gene therapeutic intervention, we have seen less work on understanding the sensitivity of network dynamics with respect to perturbations to networks, including regulatory rules and the involved parameters, which is particularly critical for the design of intervention strategies. This paper studies this less investigated issue of network sensitivity in the long run. As the underlying model of probabilistic Boolean networks is a finite Markov chain, we define the network sensitivity based on the steady-state distributions of probabilistic Boolean networks and call it long-run sensitivity. The steady-state distribution reflects the long-run behavior of the network and it can give insight into the dynamics or momentum existing in a system. The change of steady-state distribution caused by possible perturbations is the key measure for intervention. This newly defined long-run sensitivity can provide insight on both network inference and intervention. We show the results for probabilistic Boolean networks generated from random Boolean networks and the results from two real biological networks illustrate preliminary applications of sensitivity in intervention for practical problems.     

A Tutorial on Analysis and Simulation of Boolean Gene Regulatory Network Models

Driven by the desire to understand genomic functions through the interactions among genes and gene products, the research in gene regulatory networks has become a heated area in genomic signal processing. Among the most studied mathematical models are Boolean networks and probabilistic Boolean networks, which are rule-based dynamic systems. This tutorial provides an introduction to the essential concepts of these two Boolean models, and presents the up-to-date analysis and simulation methods developed for them. In the Analysis section, we will show that Boolean models are Markov chains, based on which we present a Markovian steady-state analysis on attractors, and also reveal the relationship between probabilistic Boolean networks and dynamic Bayesian networks (another popular genetic network model), again via Markov analysis; we dedicate the last subsection to structural analysis, which opens a door to other topics such as network control. The Simulation section will start from the basic tasks of creating state transition diagrams and finding attractors, proceed to the simulation of network dynamics and obtaining the steady-state distributions, and finally come to an algorithm of generating artificial Boolean networks with prescribed attractors. The contents are arranged in a roughly logical order, such that the Markov chain analysis lays the basis for the most part of Analysis section, and also prepares the readers to the topics in Simulation section.     

Designing equitable antiretroviral allocation strategies in resource-constrained countries

Background

Recently, a global commitment has been made to expand access to antiretrovirals (ARVs) in the developing world. However, in many resource-constrained countries the number of individuals infected with HIV in need of treatment will far exceed the supply of ARVs, and only a limited number of health-care facilities (HCFs) will be available for ARV distribution. Deciding how to allocate the limited supply of ARVs among HCFs will be extremely difficult. Resource allocation decisions can be made on the basis of many epidemiological, ethical, or preferential treatment priority criteria.

Methods and Findings

Here we use operations research techniques, and we show how to determine the optimal strategy for allocating ARVs among HCFs in order to satisfy the equitable criterion that each individual infected with HIV has an equal chance of receiving ARVs. We present a novel spatial mathematical model that includes heterogeneity in treatment accessibility. We show how to use our theoretical framework, in conjunction with an equity objective function, to determine an optimal equitable allocation strategy (OEAS) for ARVs in resource-constrained regions. Our equity objective function enables us to apply the egalitarian principle of equity with respect to access to health care. We use data from the detailed ARV rollout plan designed by the government of South Africa to determine an OEAS for the province of KwaZulu–Natal. We determine the OEAS for KwaZulu–Natal, and we then compare this OEAS with two other ARV allocation strategies: (i) allocating ARVs only to Durban (the largest urban city in KwaZulu–Natal province) and (ii) allocating ARVs equally to all available HCFs. In addition, we compare the OEAS to the current allocation plan of the South African government (which is based upon allocating ARVs to 17 HCFs). We show that our OEAS significantly improves equity in treatment accessibility in comparison with these three ARV allocation strategies. We also quantify how the size of the catchment region surrounding each HCF, and the number of HCFs utilized for ARV distribution, alters the OEAS and the probability of achieving equity in treatment accessibility. We calculate that in order to achieve the greatest degree of treatment equity for individuals with HIV in KwaZulu–Natal, the ARVs should be allocated to 54 HCFs and each HCF should serve a catchment region of 40 to 60 km.

Conclusion

Our OEAS would substantially improve equality in treatment accessibility in comparison with other allocation strategies. Furthermore, our OEAS is extremely different from the currently planned strategy. We suggest that our novel methodology be used to design optimal ARV allocation strategies for resource-constrained countries.     

Dynamics of unperturbed and noisy generalized Boolean networks

For years, we have been building models of gene regulatory networks, where recent advances in molecular biology shed some light on new structural and dynamical properties of such highly complex systems. In this work, we propose a novel timing of updates in random and scale-free Boolean networks, inspired by recent findings in molecular biology. This update sequence is neither fully synchronous nor asynchronous, but rather takes into account the sequence in which genes affect each other. We have used both Kauffman's original model and Aldana's extension, which takes into account the structural properties about known parts of actual GRNs, where the degree distribution is right-skewed and long-tailed. The computer simulations of the dynamics of the new model compare favorably to the original ones and show biologically plausible results both in terms of attractors number and length. We have complemented this study with a complete analysis of our systems’ stability under transient perturbations, which is one of biological networks defining attribute. Results are encouraging, as our model shows comparable and usually even better behavior than preceding ones without loosing Boolean networks attractive simplicity.     

Long non-coding RNA Linc00092 inhibits cardiac fibroblast activation by altering glycolysis in an ERK-dependent manner

AimsCardiac fibroblast (CF) activation is the key event for cardiac fibrosis. The role of glycolysis and the glycolysis-related lncRNAs in CF activation are unknown. Thus, we aimed to investigate the role of glycolysis in CF activation and to identify the glycolysis-related lncRNAs involved.Main methodsGlycolysis-related lncRNAs were searched and their expression profiles were validated in activated human CF (HCF) and human failing heart tissues. Expression of the target lncRNA was manipulated to determine its effects on HCF activation and glycolysis. The underlying mechanisms of lncRNA-dependent glycolysis regulation were also addressed.Key findingsHCF activation induced by transforming growth factor-β1 was accompanied by an enhanced glycolysis, and 2-Deoxy-d-glucose, a specific glycolysis inhibitor, dramatically attenuated HCF activation. Twenty-eight glycolysis-related lncRNAs were identified and Linc00092 expression was changed mostly upon HCF activation. In human heart tissue, Linc00092 is primarily expressed in cardiac fibroblasts. Linc00092 knockdown activated HCFs with enhanced glycolysis, while its overexpression rescued the activated phenotype of HCFs and down-regulated glycolysis. Restoration of glycolysis abolished the anti-fibrotic effects conferred by Linc00092. Linc00092 inhibited ERK activation in activated HCFs, and ERK inhibition counteracted the fibrotic phenotype in Linc00092 knockdown HCFs.SignificanceThese results revealed that Linc00092 could attenuate HCF activation by suppressing glycolysis. The inhibition of ERK by Linc00092 may play an important role in this process. Together, this provides a better understanding of the mechanism of CF activation and may serve as a novel target for cardiac fibrosis treatment.     

A Full Bayesian Approach for Boolean Genetic Network Inference

Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obtain the posterior samples of both the network structure and the related parameters. In addition to regular link addition and removal moves, which can guarantee the irreducibility of the Markov chain for traversing the whole network space, carefully constructed mixture proposals are used to improve the Markov chain Monte Carlo convergence. Both simulations and a real application on cell-cycle data show that our method is more powerful than existing methods for the inference of both the topology and logic relations of the Boolean network from observed data.     

An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data

Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is a major endeavor in bioinformatics. Boolean networks have been used extensively for modeling regulatory networks. In this model, the state of each gene can be either ‘on’ or ‘off’ and that next-state of a gene is updated, synchronously or asynchronously, according to a Boolean rule that is applied to the current-state of the entire system. Inferring a Boolean network from a set of experimental data entails two main steps: first, the experimental time-series data are discretized into Boolean trajectories, and then, a Boolean network is learned from these Boolean trajectories. In this paper, we consider three methods for data discretization, including a new one we propose, and three methods for learning Boolean networks, and study the performance of all possible nine combinations on four regulatory systems of varying dynamics complexities. We find that employing the right combination of methods for data discretization and network learning results in Boolean networks that capture the dynamics well and provide predictive power. Our findings are in contrast to a recent survey that placed Boolean networks on the low end of the “faithfulness to biological reality” and “ability to model dynamics” spectra. Further, contrary to the common argument in favor of Boolean networks, we find that a relatively large number of time points in the time-series data is required to learn good Boolean networks for certain data sets. Last but not least, while methods have been proposed for inferring Boolean networks, as discussed above, missing still are publicly available implementations thereof. Here, we make our implementation of the methods available publicly in open source at http://bioinfo.cs.rice.edu/.     

Inferring gene regulatory networks with time delays using a genetic algorithm

Recently a state-space model with time delays for inferring gene regulatory networks was proposed. It was assumed that each regulation between two internal state variables had multiple time delays. This assumption caused underestimation of the model with many current gene expression datasets. In biological reality, one regulatory relationship may have just a single time delay, and not multiple time delays. This study employs Boolean variables to capture the existence of the time-delayed regulatory relationships in gene regulatory networks in terms of the state-space model. As the solution space of time delayed relationships is too large for an exhaustive search, a genetic algorithm (GA) is proposed to determine the optimal Boolean variables (the optimal time-delayed regulatory relationships). Coupled with the proposed GA, Bayesian information criterion (BIC) and probabilistic principle component analysis (PPCA) are employed to infer gene regulatory networks with time delays. Computational experiments are performed on two real gene expression datasets. The results show that the GA is effective at finding time-delayed regulatory relationships. Moreover, the inferred gene regulatory networks with time delays from the datasets improve the prediction accuracy and possess more of the expected properties of a real network, compared to a gene regulatory network without time delays.     

Probabilistic Boolean Networks: a rule-based uncertainty model for gene regulatory networks

MOTIVATION: Our goal is to construct a model for genetic regulatory networks such that the model class: (i) incorporates rule-based dependencies between genes; (ii) allows the systematic study of global network dynamics; (iii) is able to cope with uncertainty, both in the data and the model selection; and (iv) permits the quantification of the relative influence and sensitivity of genes in their interactions with other genes. RESULTS: We introduce Probabilistic Boolean Networks (PBN) that share the appealing rule-based properties of Boolean networks, but are robust in the face of uncertainty. We show how the dynamics of these networks can be studied in the probabilistic context of Markov chains, with standard Boolean networks being special cases. Then, we discuss the relationship between PBNs and Bayesian networks--a family of graphical models that explicitly represent probabilistic relationships between variables. We show how probabilistic dependencies between a gene and its parent genes, constituting the basic building blocks of Bayesian networks, can be obtained from PBNs. Finally, we present methods for quantifying the influence of genes on other genes, within the context of PBNs. Examples illustrating the above concepts are presented throughout the paper.     

Nested Canalyzing Depth and Network Stability

We introduce the nested canalyzing depth of a function, which measures the extent to which it retains a nested canalyzing structure. We characterize the structure of functions with a given depth and compute the expected activities and sensitivities of the variables. This analysis quantifies how canalyzation leads to higher stability in Boolean networks. It generalizes the notion of nested canalyzing functions (NCFs), which are precisely the functions with maximum depth. NCFs have been proposed as gene regulatory network models, but their structure is frequently too restrictive and they are extremely sparse. We find that functions become decreasingly sensitive to input perturbations as the canalyzing depth increases, but exhibit rapidly diminishing returns in stability. Additionally, we show that as depth increases, the dynamics of networks using these functions quickly approach the critical regime, suggesting that real networks exhibit some degree of canalyzing depth, and that NCFs are not significantly better than functions of sufficient depth for many applications of the modeling and reverse engineering of biological networks.     

A multi-objective differential evolutionary approach toward more stable gene regulatory networks

Models are of central importance in many scientific contexts. Mathematical and computational modeling of genetic regulatory networks promises to uncover the fundamental principles of living systems. Biological models, such as gene regulatory models, can help us better understand interactions among genes and how cells regulate their production of proteins and enzymes. One feature shared among living systems is their ability to cope with perturbations and remain stable, a property that is the result of evolutionary fine-tuning over many generations. In this study we use random Boolean networks (RBNs) as an abstract model of gene regulatory systems. By applying Differential Evolution (DE), an evolution-based optimization technique, we produce networks with increased stability. DE requires relatively few user-specified parameters, has fast convergence and does not rely on initial conditions to find the global minima within multi-dimensional search spaces.     

Chain functions and scoring functions in genetic networks

One of the grand challenges of system biology is to reconstruct the network of regulatory control among genes and proteins. High throughput data, particularly from expression experiments, may gradually make this possible in the future. Here we address two key ingredients in any such 'reverse engineering' effort: The choice of a biologically relevant, yet restricted, set of potential regulation functions, and the appropriate score to evaluate candidate regulatory relations. We propose a set of regulation functions which we call chain functions, and argue for their ubiquity in biological networks. We analyze their complexity and show that their number is exponentially smaller than all boolean functions of the same dimension. We define two new scores: one evaluating the fitness of a candidate set of regulators of a particular gene, and the other evaluating a candidate function. Both scores use established statistical methods. Finally, we test our methods on experimental gene expression data from the yeast galactose pathway. We show the utility of using chain functions and the improved inference using our scores in comparison to several extant scores. We demonstrate that the combined use of the two scores gives an extra advantage. We expect both chain functions and the new scores to be helpful in future attempts to infer regulatory networks.