boolean networks
Recently Published Documents


TOTAL DOCUMENTS

1053
(FIVE YEARS 258)

H-INDEX

53
(FIVE YEARS 11)

2022 ◽  
Vol 44 ◽  
pp. 101141
Author(s):  
Rong Zhao ◽  
Biao Wang ◽  
Jun-e Feng
Keyword(s):  

2022 ◽  
Vol 18 (1) ◽  
pp. e1009702
Author(s):  
Ulrike Münzner ◽  
Tomoya Mori ◽  
Marcus Krantz ◽  
Edda Klipp ◽  
Tatsuya Akutsu

Boolean networks (BNs) have been developed to describe various biological processes, which requires analysis of attractors, the long-term stable states. While many methods have been proposed to detection and enumeration of attractors, there are no methods which have been demonstrated to be theoretically better than the naive method and be practically used for large biological BNs. Here, we present a novel method to calculate attractors based on a priori information, which works much and verifiably faster than the naive method. We apply the method to two BNs which differ in size, modeling formalism, and biological scope. Despite these differences, the method presented here provides a powerful tool for the analysis of both networks. First, our analysis of a BN studying the effect of the microenvironment during angiogenesis shows that the previously defined microenvironments inducing the specialized phalanx behavior in endothelial cells (ECs) additionally induce stalk behavior. We obtain this result from an extended network version which was previously not analyzed. Second, we were able to heuristically detect attractors in a cell cycle control network formalized as a bipartite Boolean model (bBM) with 3158 nodes. These attractors are directly interpretable in terms of genotype-to-phenotype relationships, allowing network validation equivalent to an in silico mutagenesis screen. Our approach contributes to the development of scalable analysis methods required for whole-cell modeling efforts.


Author(s):  
Athénaïs Vaginay ◽  
Taha Boukhobza ◽  
Malika Smaïl-Tabbone
Keyword(s):  

Author(s):  
Luca Agostini

Random Boolean networks, originally introduced as simplified models for the genetic regulatory networks, are abstract models widely applied for the study of the dynamical behaviors of self-organizing complex systems. In these networks, connectivity and the bias of the Boolean functions are the most important factors that can determine the behavioral regime of the systems. On the other hand, it has been found that topology and some structural elements of the networks such as the reciprocity, self-loops and source nodes, can have relevant effects on the dynamical properties of critical Boolean networks. In this paper, we study the impact of source and sink nodes on the dynamics of homogeneous and heterogeneous Boolean networks. Our research shows that an increase of the source nodes causes an exponentially growing of the different behaviors that the system can exhibit regardless of the network topology, while the amount of order seems to undergo modifications depending on the topology of the system. Indeed, with the increase of the source nodes the orderliness of the heterogeneous networks also increases, whereas it diminishes in the homogeneous ones. On the other hand, although the sink nodes seem not to have effects on the dynamic of the homogeneous networks, for the heterogeneous ones we have found that an increase of the sinks gives rise to an increasing of the order, although the different potential behaviors of the system remains approximately the same.


2021 ◽  
Vol 9 ◽  
Author(s):  
Xiaodong Cui ◽  
Binghao Ren ◽  
Zhenghan Li

Inference of the gene regulation mechanism from gene expression patterns has become increasingly popular, in recent years, with the advent of microarray technology. Obtaining the states of genes and their regulatory relationships would greatly enable the scientists to investigate and understand the mechanisms of the diseases. However, it is still a big challenge to determine relationships from several thousands of genes. Here, we simplify the above complex gene state determination problem as an inference of the distribution of the ensemble Boolean networks (BNs). In order to investigate and calculate the distribution of the BNs’ states, we first compute the probabilities of the different BNs’ states and obtain the number of states Ω. Then, we find the maximum possible distribution of the number of the BNs’ states and calculate the fluctuation of the distribution. Finally, two representative experiments are conducted, and the efficiency of the obtained results is verified. The proposed algorithm is conceptually concise and easily applicable to many other realistic models; furthermore, it is highly extensible for various situations.


Sign in / Sign up

Export Citation Format

Share Document