A Study on Attractors of Generalized Asynchronous Random Boolean Networks

Van Giang TRINH  Kunihiko HIRAISHI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E103-A   No.8   pp.987-994
Publication Date: 2020/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.2019EAP1163
Type of Manuscript: PAPER
Category: Mathematical Systems Science
gene regulatory networks,  generalized asynchronous random Boolean networks,  attractors,  binary decision diagrams,  SAT,  

Full Text: PDF(712.4KB)>>
Buy this Article

Boolean networks (BNs) are considered as popular formal models for the dynamics of gene regulatory networks. There are many different types of BNs, depending on their updating scheme (synchronous, asynchronous, deterministic, or non-deterministic), such as Classical Random Boolean Networks (CRBNs), Asynchronous Random Boolean Networks (ARBNs), Generalized Asynchronous Random Boolean Networks (GARBNs), Deterministic Asynchronous Random Boolean Networks (DARBNs), and Deterministic Generalized Asynchronous Random Boolean Networks (DGARBNs). An important long-term behavior of BNs, so-called attractor, can provide valuable insights into systems biology (e.g., the origins of cancer). In the previous paper [1], we have studied properties of attractors of GARBNs, their relations with attractors of CRBNs, also proposed different algorithms for attractor detection. In this paper, we propose a new algorithm based on SAT-based bounded model checking to overcome inherent problems in these algorithms. Experimental results prove the effectiveness of the new algorithm. We also show that studying attractors of GARBNs can pave potential ways to study attractors of ARBNs.