Uncovering dynamic structures within cyclic attractors of asynchronous Boolean networks with spectral clustering
Journal article, Peer reviewed
Accepted version
View/ Open
Date
2024Metadata
Show full item recordCollections
- Department of Informatics [992]
- Registrations from Cristin [10863]
Original version
Lecture Notes in Computer Science (LNCS). 2024, 14971, 226–246. 10.1007/978-3-031-71671-3_16Abstract
Boolean models provide an intuitive framework for the investigation of complex biological networks. Dynamics that implement asynchronous update rules, in particular, can help embody the complexity arising from non-deterministic behavior. These transition systems allow for the emergence of complex attractors, cyclic subgraphs that capture oscillating asymptotic behavior. Techniques that explore and attempt to describe the structures of these attractors have received limited attention. In this context, the incorporation of process rate information may yield additional insights into dynamical patterns. Here, we propose to use a spectral clustering algorithm on the kinetic rate matrix of time-continuous Boolean networks to uncover dynamic structures within cyclic attractors. The Robust Perron Cluster Analysis (PCCA+) can be used to unravel metastable sets in Markov jump processes, i.e. sets in which a system remains for a long time before it switches to another metastable set. As a proof-of-concept, we apply this method to Boolean models of the mammalian cell cycle. By considering the categorization of transitions as either slow or fast, we investigate the impact of time information on the emergence of significant sub-structures.
Description
Under embargo until: 2025-09-19