Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming - Aix-Marseille Université Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming

Résumé

Boolean Networks (BNs) are an efficient modeling formalism with applications in various research fields such as mathematics, computer science, and more recently systems biology. One crucial problem in the BN research is to enumerate all fixed points, which has been proven crucial in the analysis and control of biological systems. Indeed, in that field, BNs originated from the pioneering work of R. Thomas on gene regulation and from the start were characterized by their asymptotic behavior: complex attractors and fixed points. The former being notably more difficult to compute exactly, and specific to certain biological systems, the computation of stable states (fixed points) has been the standard way to analyze those BNs for years. However, with the increase in model size and complexity of Boolean update functions, the existing methods for this problem show their limitations. To our knowledge, the most efficient state-of-the-art methods for the fixed point enumeration problem rely on Answer Set Programming (ASP). Motivated by these facts, in this work we propose two new efficient ASP-based methods to solve this problem. We evaluate them on both real-world and pseudo-random models, showing that they vastly outperform four state-of-the-art methods as well as can handle very large and complex models.
Fichier principal
Vignette du fichier
LIPIcs.CP.2023.pdf (35.56 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Licence : CC BY - Paternité

Dates et versions

hal-04209296 , version 1 (22-09-2023)

Licence

Paternité

Identifiants

Citer

Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman. Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Aug 2023, Toronto, Canada. pp.35:1--35:19, ⟨10.4230/LIPIcs.CP.2023.35⟩. ⟨hal-04209296⟩
83 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More