Photo by cosmicwriter from unsplash
Boolean networks is a well-established formalism for modelling biological systems. A vital challenge for analyzing a Boolean network is to identify all the attractors. This becomes more challenging for large… Click to show full abstract
Boolean networks is a well-established formalism for modelling biological systems. A vital challenge for analyzing a Boolean network is to identify all the attractors. This becomes more challenging for large asynchronous Boolean networks, due to the asynchronous scheme. Existing methods are prohibited due to the well-known state-space explosion problem in large Boolean networks. In this paper, we tackle this challenge by proposing a SCC-based decomposition method. We prove the correctness of our proposed method and demonstrate its efficiency with two real-life biological networks.
Journal Title: IEEE/ACM Transactions on Computational Biology and Bioinformatics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!