Uncovering Dynamic Structures Within Cyclic Attractors of Asynchronous Boolean Networks with Spectral Clustering

被引:0
|
作者
Yousefian, Maryam [1 ]
Tonello, Elisa [2 ]
Frank, Anna-Simone [1 ]
Siebert, Heike [3 ]
Roblitz, Susanna [1 ]
机构
[1] Univ Bergen, Dept Informat, Computat Biol Unit, N-5008 Bergen, Norway
[2] Free Univ Berlin, Dept Math & Comp Sci, Arnimallee 7, D-14195 Berlin, Germany
[3] Univ Kiel, Dept Math, Heinrich Hecht Pl 6, D-24118 Kiel, Germany
关键词
Time-continuous Boolean networks; Markov chains; Robust Perron cluster analysis (PCCA plus ); Mammalian cell cycle; MARKOV STATE MODELS;
D O I
10.1007/978-3-031-71671-3_16
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:226 / 246
页数:21
相关论文
共 24 条
  • [1] Attractors and Basins of Asynchronous Random Boolean Networks
    Yang Meng
    Chu Tianguang
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 6392 - 6397
  • [2] A Study on Attractors of Generalized Asynchronous Random Boolean Networks
    Trinh, Van Giang
    Hiraishi, Kunihiko
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (08) : 987 - 994
  • [3] Evaluation of attractors and basins of asynchronous random Boolean networks
    Yang, Meng
    Chu, Tianguang
    PHYSICAL REVIEW E, 2012, 85 (05):
  • [4] An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks
    Zheng, Desheng
    Yang, Guowu
    Li, Xiaoyu
    Wang, Zhicai
    Liu, Feng
    He, Lei
    PLOS ONE, 2013, 8 (04):
  • [5] Time out of joint: Attractors in asynchronous random Boolean networks
    Harvey, I
    Bossomaier, T
    FOURTH EUROPEAN CONFERENCE ON ARTIFICIAL LIFE, 1997, : 67 - 75
  • [6] Algorithms for Finding Attractors of Generalized Asynchronous Random Boolean Networks
    Trinh Van Giang
    Hiraishi, Kunihiko
    2019 12TH ASIAN CONTROL CONFERENCE (ASCC), 2019, : 67 - 72
  • [7] Rhythmic and non-rhythmic attractors in asynchronous random Boolean networks
    Di Paolo, EA
    BIOSYSTEMS, 2001, 59 (03) : 185 - 195
  • [8] Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics
    Tournier, L.
    Chaves, M.
    JOURNAL OF THEORETICAL BIOLOGY, 2009, 260 (02) : 196 - 209
  • [9] An Improved Method for Finding Attractors of Large-Scale Asynchronous Boolean Networks
    Trinh Van Giang
    Hiraishi, Kunihiko
    2021 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY (CIBCB), 2021, : 246 - 254
  • [10] Uncovering networks within protein structures.
    Albrecht, B
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2005, 229 : U803 - U804