2017/04/20 by Andrzej Mizera, Mizera, Andrzej, Jun Pang +5
Biochemistry, Genetics and Molecular Biology · Engineering · #DNA and Biological Computing #Distributed #FOS: Biological sciences #FOS: Computer and information sciences #Gene Regulatory Network Analysis #Molecular Communication and Nanonetworks #Molecular Networks (q-bio.MN) #Parallel #Quantitative Methods (q-bio.QM) #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1704.06530
openalex publication_date 2017/04/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Boolean networks is a well-established formalism for modelling biological systems. A vital challenge for analysing a Boolean network is to identify all the attractors. This becomes more challenging for large asynchronous Boolean networks, due to the asynchronous updating 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.