Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming - Aix-Marseille Université Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming

Résumé

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).
Fichier principal
Vignette du fichier
28943-Article Text-32997-1-2-20240324.pdf (161.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04523118 , version 1 (27-03-2024)

Identifiants

Citer

Giang Trinh, Belaid Benhamou, Samuel Pastva, Sylvain Soliman. Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. AAAI 2024 - The 38th Annual Conference on Artificial Intelligence, Feb 2024, Vancouver, Canada. pp.10714-10722, ⟨10.1609/aaai.v38i9.28943⟩. ⟨hal-04523118⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More