Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Lu J
PROVIDER: S-EPMC4551960 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:This paper presents an analytical study of synchronization in an array of output-coupled temporal Boolean networks. A temporal Boolean network (TBN) is a logical dynamic system developed to model Boolean networks with regulatory delays. Both state delay and output delay are considered, and these two delays are assumed to be different. By referring to the algebraic representations of logical dynamics and using the semi-tensor product of matrices, the output-coupled TBNs are firstly converted into a discrete-time algebraic evolution system, and then the relationship between the states of coupled TBNs and the initial state sequence is obtained. Then, some necessary and sufficient conditions are derived for the synchronization of an array of TBNs with an arbitrary given initial state sequence. Two numerical examples including one epigenetic model are finally given to illustrate the obtained results.
| S-EPMC4164038 | biostudies-literature
Project description:BackgroundThere exist several computational tools which allow for the optimisation and inference of biological networks using a Boolean formalism. Nevertheless, the results from such tools yield only limited quantitative insights into the complexity of biological systems because of the inherited qualitative nature of Boolean networks.ResultsWe introduce optPBN, a Matlab-based toolbox for the optimisation of probabilistic Boolean networks (PBN) which operates under the framework of the BN/PBN toolbox. optPBN offers an easy generation of probabilistic Boolean networks from rule-based Boolean model specification and it allows for flexible measurement data integration from multiple experiments. Subsequently, optPBN generates integrated optimisation problems which can be solved by various optimisers. In term of functionalities, optPBN allows for the construction of a probabilistic Boolean network from a given set of potential constitutive Boolean networks by optimising the selection probabilities for these networks so that the resulting PBN fits experimental data. Furthermore, the optPBN pipeline can also be operated on large-scale computational platforms to solve complex optimisation problems. Apart from exemplary case studies which we correctly inferred the original network, we also successfully applied optPBN to study a large-scale Boolean model of apoptosis where it allows identifying the inverse correlation between UVB irradiation, NFκB and Caspase 3 activations, and apoptosis in primary hepatocytes quantitatively. Also, the results from optPBN help elucidating the relevancy of crosstalk interactions in the apoptotic network.SummaryThe optPBN toolbox provides a simple yet comprehensive pipeline for integrated optimisation problem generation in the PBN formalism that can readily be solved by various optimisers on local or grid-based computational platforms. optPBN can be further applied to various biological studies such as the inference of gene regulatory networks or the identification of the interaction's relevancy in signal transduction networks.
| S-EPMC4077690 | biostudies-literature
Project description:MotivationA key goal of studying biological systems is to design therapeutic intervention strategies. Probabilistic Boolean networks (PBNs) constitute a mathematical model which enables modeling, predicting and intervening in their long-run behavior using Markov chain theory. The long-run dynamics of a PBN, as represented by its steady-state distribution (SSD), can guide the design of effective intervention strategies for the modeled systems. A major obstacle for its application is the large state space of the underlying Markov chain, which poses a serious computational challenge. Hence, it is critical to reduce the model complexity of PBNs for practical applications.ResultsWe propose a strategy to reduce the state space of the underlying Markov chain of a PBN based on a criterion that the reduction least distorts the proportional change of stationary masses for critical states, for instance, the network attractors. In comparison to previous reduction methods, we reduce the state space directly, without deleting genes. We then derive stationary control policies on the reduced network that can be naturally induced back to the original network. Computational experiments study the effects of the reduction on model complexity and the performance of designed control policies which is measured by the shift of stationary mass away from undesirable states, those associated with undesirable phenotypes. We consider randomly generated networks as well as a 17-gene gastrointestinal cancer network, which, if not reduced, has a 2(17) × 2(17) transition probability matrix. Such a dimension is too large for direct application of many previously proposed PBN intervention strategies.
| S-EPMC3025721 | biostudies-literature
Project description:We developed a computational approach to find the best intervention to achieve transcription factor (TF) mediated transdifferentiation. We construct probabilistic Boolean networks (PBNs) from single-cell RNA sequencing data of two different cell states to model hematopoietic transcription factors cross-talk. This was achieved by a "sampled network" approach, which enabled us to construct large networks. The interventions to induce transdifferentiation consisted of permanently activating or deactivating each of the TFs and determining the probability mass transfer of steady-state probabilities from the departure to the destination cell type or state. Our findings support the common assumption that TFs that are differentially expressed between the two cell types are the best intervention points to achieve transdifferentiation. TFs whose interventions are found to transdifferentiate progenitor B cells into monocytes include EBF1 down-regulation, CEBPB up-regulation, TCF3 down-regulation, and STAT3 up-regulation.
| S-EPMC9460527 | biostudies-literature
Project description:Boolean matrix factorization (BMF) is a combinatorial problem arising from a wide range of applications including recommendation system, collaborative filtering, and dimensionality reduction. Currently, the noise model of existing BMF methods is often assumed to be homoscedastic; however, in real world data scenarios, the deviations of observed data from their true values are almost surely diverse due to stochastic noises, making each data point not equally suitable for fitting a model. In this case, it is not ideal to treat all data points as equally distributed. Motivated by such observations, we introduce a probabilistic BMF model that recognizes the object- and feature-wise bias distribution respectively, called bias aware BMF (BABF). To the best of our knowledge, BABF is the first approach for Boolean decomposition with consideration of the feature-wise and object-wise bias in binary data. We conducted experiments on datasets with different levels of background noise, bias level, and sizes of the signal patterns, to test the effectiveness of our method in various scenarios. We demonstrated that our model outperforms the state-of-the-art factorization methods in both accuracy and efficiency in recovering the original datasets, and the inferred bias level is highly significantly correlated with true existing bias in both simulated and real world datasets.
| S-EPMC10421704 | biostudies-literature
Project description:MotivationRandom sampling of metabolic fluxes can provide a comprehensive description of the capabilities of a metabolic network. However, current sampling approaches do not model thermodynamics explicitly, leading to inaccurate predictions of an organism's potential or actual metabolic operations.ResultsWe present a probabilistic framework combining thermodynamic quantities with steady-state flux constraints to analyze the properties of a metabolic network. It includes methods for probabilistic metabolic optimization and for joint sampling of thermodynamic and flux spaces. Applied to a model of E. coli, we use the methods to reveal known and novel mechanisms of substrate channeling, and to accurately predict reaction directions and metabolite concentrations. Interestingly, predicted flux distributions are multimodal, leading to discrete hypotheses on E. coli's metabolic capabilities.AvailabilityPython and MATLAB packages available at https://gitlab.com/csb.ethz/pta.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC8479673 | biostudies-literature
Project description:Boolean networks with asynchronous updates are a class of logical models particularly well adapted to describe the dynamics of biological networks with uncertain measures. The state space of these models can be described by an asynchronous state transition graph, which represents all the possible exits from every single state, and gives a global image of all the possible trajectories of the system. In addition, the asynchronous state transition graph can be associated with an absorbing Markov chain, further providing a semi-quantitative framework where it becomes possible to compute probabilities for the different trajectories. For large networks, however, such direct analyses become computationally untractable, given the exponential dimension of the graph. Exploiting the general modularity of biological systems, we have introduced the novel concept of asymptotic graph, computed as an interconnection of several asynchronous transition graphs and recovering all asymptotic behaviors of a large interconnected system from the behavior of its smaller modules. From a modeling point of view, the interconnection of networks is very useful to address for instance the interplay between known biological modules and to test different hypotheses on the nature of their mutual regulatory links. This paper develops two new features of this general methodology: a quantitative dimension is added to the asymptotic graph, through the computation of relative probabilities for each final attractor and a companion cross-graph is introduced to complement the method on a theoretical point of view.
| S-EPMC5987301 | biostudies-literature
Project description:We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman's Ergodic Set and use it to study the long term dynamics of a BN. We define the sensitivity of a BN to be the mean change in its Ergodic Set structure under all possible loss of interaction mutations. In silico experiments were used to selectively evolve BNs for sensitivity to losing interactions. We find that maximum sensitivity was often achievable and resulted in the BNs becoming topologically balanced, i.e. they evolve towards network structures in which they have a similar number of inhibitory and excitatory interactions. In terms of the dynamics, the dominant sensitivity strategy that evolved was to build BNs with Ergodic Sets dominated by a single long limit cycle which is easily destabilised by mutations. We discuss the relevance of our findings in the context of Stem Cell Differentiation and propose a relationship between pluripotent stem cells and our evolved sensitive networks.
| S-EPMC3346810 | biostudies-literature
Project description:The optimization problem aiming at the identification of minimal sets of nodes able to drive the dynamics of Boolean networks toward desired long-term behaviors is central for some applications, as for example the detection of key therapeutic targets to control pathways in models of biological signaling and regulatory networks. Here, we develop a method to solve such an optimization problem taking inspiration from the well-studied problem of influence maximization for spreading processes in social networks. We validate the method on small gene regulatory networks whose dynamical landscapes are known by means of brute-force analysis. We then systematically study a large collection of gene regulatory networks. We find that for about 65% of the analyzed networks, the minimal driver sets contain less than 20% of their nodes.
| S-EPMC9203747 | biostudies-literature
Project description:Oscillatory neural activity is dynamically controlled to coordinate perceptual, attentional and cognitive processes. On the macroscopic scale, this control is reflected in the U-shaped deviations of EEG spectral-power dynamics from stochastic dynamics, characterized by disproportionately elevated occurrences of the lowest and highest ranges of power. To understand the mechanisms that generate these low- and high-power states, we fit a simple mathematical model of synchronization of oscillatory activity to human EEG data. The results consistently indicated that the majority (~95%) of synchronization dynamics is controlled by slowly adjusting the probability of synchronization while maintaining maximum entropy within the timescale of a few seconds. This strategy appears to be universal as the results generalized across oscillation frequencies, EEG current sources, and participants (N = 52) whether they rested with their eyes closed, rested with their eyes open in a darkened room, or viewed a silent nature video. Given that precisely coordinated behavior requires tightly controlled oscillatory dynamics, the current results suggest that the large-scale spatial synchronization of oscillatory activity is controlled by the relatively slow, entropy-maximizing adjustments of synchronization probability (demonstrated here) in combination with temporally precise phase adjustments (e.g., phase resetting generated by sensorimotor interactions). Interestingly, we observed a modest but consistent spatial pattern of deviations from the maximum-entropy rule, potentially suggesting that the mid-central-posterior region serves as an "entropy dump" to facilitate the temporally precise control of spectral-power dynamics in the surrounding regions.
| S-EPMC8087389 | biostudies-literature