Informace o publikaci
Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming
| Autoři | |
|---|---|
| Rok publikování | 2024 |
| Druh | Článek ve sborníku |
| Konference | Proceedings of the AAAI Conference on Artificial Intelligence |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | https://ojs.aaai.org/index.php/AAAI/article/view/28943 |
| Doi | http://dx.doi.org/10.1609/aaai.v38i9.28943 |
| Klíčová slova | Trap Space; Boolean Network; Answer Set Programming |
| Přiložené soubory | |
| Popis | Boolean Networks (BNs) are widely used as a modeling formalism in several domains, notably systems biology and computer science. A fundamental problem in BN analysis is the enumeration of trap spaces, which are hypercubes in the state space that cannot be escaped once entered. Several methods have been proposed for enumerating trap spaces, however they often suffer from scalability and efficiency issues, particularly for large and complex models. To our knowledge, the most efficient and recent methods for the trap space enumeration all rely on Answer Set Programming (ASP), which has been widely applied to the analysis of BNs. Motivated by these considerations, our work proposes a new method for enumerating trap spaces in BNs using ASP. We evaluate the method on a mix of 250+ real-world and 400+ randomly generated BNs, showing that it enables analysis of models beyond the capabilities of existing tools (namely pyboolnet, mpbn, trappist, and trapmvn). |