SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks - Archive ouverte HAL
Conference Papers Year : 2023

SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks

Takehide Soh
  • Function : Author
  • PersonId : 1221563
Mutsunori Banbara
  • Function : Author
  • PersonId : 1221564
Naoyuki Tamura
  • Function : Author
  • PersonId : 1221565

Abstract

In this paper, we propose a SAT-based method for finding attractors of bounded size in asynchronous automata networks. The automata network is a multi-valued mathematical model which has been studied for the quali- tative modeling of biological regulatory networks. An attractor is a minimal set of states in automata networks that cannot be escaped and thus loops indefinitely. Attractors are crucial to validate the initial design of a biological model and predict possible asymptotic behaviors, e.g., how cells may result through maturation in differentiated cell types. Developing an efficient computational method to find attractors is thus an important research topic. Our contribution is a translation of the problem of finding attractors of automata networks into a sequence of propositional satisfiability (SAT) problems. We also propose to add two optional constraints to improve the computation time of attractors. Experiments are carried out using 30 automata networks, 8 coming from real biological case studies and 22 crafted ones with controlled attractor size. The experimental results show that our method scales better than the state-of-the-art ASP method when the size of the attractors increases.
Fichier principal
Vignette du fichier
paper.pdf (228.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence

Dates and versions

hal-03964870 , version 1 (13-09-2023)

Licence

Identifiers

  • HAL Id : hal-03964870 , version 1

Cite

Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura. SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. 14th International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2023), Feb 2023, Lisbon, Portugal. ⟨hal-03964870⟩
178 View
110 Download

Share

More