License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2023.35
URN: urn:nbn:de:0030-drops-190720
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19072/
Trinh, Van-Giang ;
Benhamou, Belaid ;
Soliman, Sylvain
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming
Abstract
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.
BibTeX - Entry
@InProceedings{trinh_et_al:LIPIcs.CP.2023.35,
author = {Trinh, Van-Giang and Benhamou, Belaid and Soliman, Sylvain},
title = {{Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming}},
booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-300-3},
ISSN = {1868-8969},
year = {2023},
volume = {280},
editor = {Yap, Roland H. C.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19072},
URN = {urn:nbn:de:0030-drops-190720},
doi = {10.4230/LIPIcs.CP.2023.35},
annote = {Keywords: Computational systems biology, Boolean network, Fixed point, Answer set programming}
}
