![]() Mizera, Andrzej ![]() ![]() in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2019), 16(1), 31-42 Detailed reference viewed: 129 (3 UL)![]() ; Mizera, Andrzej ![]() ![]() in Science of Computer Programming (2019), 180 Detailed reference viewed: 106 (5 UL)![]() Mizera, Andrzej ![]() ![]() in Proceedings of the 16th International Conference on Computational Methods in Systems Biology (2018) Detailed reference viewed: 130 (3 UL)![]() Mizera, Andrzej ![]() ![]() in Proceedings of the 3rd International Symposium on Dependable Software Engineering: Theories, Tools, and Applications (2017) Detailed reference viewed: 159 (5 UL)![]() Yuan, Qixia ![]() ![]() in Science China Information Sciences (2016), 59(8), 0801011-08010116 Detailed reference viewed: 175 (26 UL)![]() ; Yuan, Qixia ![]() ![]() in Proceedings of the 7th Asia-Pacific Symposium on Internetware (2015) Boolean networks are an important formalism for modelling biological systems and have attracted much attention in recent years. An important direction in Boolean networks is to exhaustively find ... [more ▼] Boolean networks are an important formalism for modelling biological systems and have attracted much attention in recent years. An important direction in Boolean networks is to exhaustively find attractors, which represent steady states when a biological network evolves for a long term. In this paper, we propose a new approach to improve the efficiency of BDD-based attractor detection. Our approach includes a monolithic algorithm for small networks, an enumerative strategy to deal with large networks, and two heuristics on ordering BDD variables. We demonstrate the performance of our approach on a number of examples, and compare it with one existing technique in the literature. [less ▲] Detailed reference viewed: 131 (6 UL) |
||