An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?
Journal of Mathematical Biology · 2025
DOI: 10.1007/s00285-025-02235-8 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Mathematical Biology, 2025. Verfasst von Samuel Pastva und 4 weiteren Autor:innen. Beteiligte Einrichtung: Faculty of Informatics, Masaryk University, Botanicka 68a, 60200, Brno, Czech Republic. xpastva@fi.muni.cz. Hauptthemen laut MEDLINE: Models, Biological. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 57 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, Army Research Office, Grantová Agentura Ceské Republiky.
Abstract (Originalsprache)
Asynchronous Boolean networks are a type of discrete dynamical system in which each variable can take one of two states, and a single variable state is updated in each time step according to pre-selected rules. Boolean networks are popular in systems biology due to their ability to model long-term biological phenotypes within a qualitative, predictive framework. Boolean networks model phenotypes as attractors, which are closely linked to minimal trap spaces (inescapable hypercubes in the system’s state space). In biological applications, attractors and minimal trap spaces are typically in one-to-one correspondence. However, this correspondence is not guaranteed: motif-avoidant attractors (MAAs) that lie outside minimal trap spaces are possible. MAAs are rare and poorly understood, despite recent efforts. In this contribution to the BMB & JMB Special Collection “Problems, Progress and Perspectives in Mathematical and Computational Biology”, we summarize the current state of knowledge regarding MAAs and present several novel observations regarding their response to node deletion reductions and linear extensions of edges. We conduct large-scale computational studies on an ensemble of 14 000 models derived from published Boolean models of biological systems, and more than 100 million Random Boolean Networks. Our findings quantify the rarity of MAAs; in particular, we only observed MAAs in biological models after applying standard simplification methods, highlighting the role of network reduction in introducing MAAs into the dynamics. We also show that MAAs are fragile to linear extensions: in sparse networks, even a single linear node can disrupt virtually all MAAs. Motivated by this observation, we improve the upper bound on the number of delays needed to disrupt a motif-avoidant attractor.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Faculty of Informatics, Masaryk University, Botanicka 68a, 60200, Brno, Czech Republic. xpastva@fi.muni.cz.
- Institute of Science and Technology Austria, Am Campus 1, 3400, Klosterneuburg, Austria. xpastva@fi.muni.cz.
- Department of Physics, Davey Laboratory, Pennsylvania State University, 16802, University Park, Pennsylvania, USA.
- Faculty of Informatics, Masaryk University, Botanicka 68a, 60200, Brno, Czech Republic.
- Department of Systems Science and Industrial Engineering, Binghamton University (State University of New York), Engineering Building, 13850, Vestal, New York, USA. jrozum@binghamton.edu.
- Department of Physics, Davey Laboratory, Pennsylvania State University, 16802, University Park, Pennsylvania, USA. rza1@psu.edu.
Förderung
- National Science Foundation
- Army Research Office
- Grantová Agentura Ceské Republiky
- HORIZON EUROPE Marie Sklodowska-Curie Actions
Zitieren
APA
Pastva, S., Park, K. H., Huvar, O., Rozum, J. C., & Albert, R. (2025). An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?. Journal of Mathematical Biology. https://doi.org/10.1007/s00285-025-02235-8
Vancouver
Pastva S, Park KH, Huvar O, Rozum JC, Albert R. An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?. Journal of Mathematical Biology. 2025. doi:10.1007/s00285-025-02235-8
BibTeX
@article{Pastva2025,
author = {Pastva, Samuel and Park, Kyu Hyong and Huvar, Ondřej and Rozum, Jordan C and Albert, Réka},
title = {An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?},
journal = {Journal of Mathematical Biology},
year = {2025},
doi = {10.1007/s00285-025-02235-8}
}
EUVIMED