A scalable moment-closure approximation for large-scale biochemical reaction networks

被引:2
|
作者
Kazeroonian, Atefeh [1 ,2 ,3 ]
Theis, Fabian J. [1 ,2 ]
Hasenauer, Jan [1 ,2 ]
机构
[1] Helmholtz Zentrum Munchen, German Res Ctr Environm Hlth, Inst Computat Biol, D-85764 Neuherberg, Germany
[2] Tech Univ Munich, Dept Math, D-85748 Garching, Germany
[3] Tech Univ Munich, Fak Med, Inst Med Mikrobiol Immunol & Hyg, D-81675 Munich, Germany
关键词
STOCHASTIC GENE-EXPRESSION;
D O I
10.1093/bioinformatics/btx249
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Stochastic molecular processes are a leading cause of cell-to-cell variability. Their dynamics are often described by continuous-time discrete-state Markov chains and simulated using stochastic simulation algorithms. As these stochastic simulations are computationally demanding, ordinary differential equation models for the dynamics of the statistical moments have been developed. The number of state variables of these approximating models, however, grows at least quadratically with the number of biochemical species. This limits their application to small-and medium-sized processes. Results: In this article, we present a scalable moment-closure approximation (sMA) for the simulation of statistical moments of large-scale stochastic processes. The sMA exploits the structure of the biochemical reaction network to reduce the covariance matrix. We prove that sMA yields approximating models whose number of state variables depends predominantly on local properties, i.e. the average node degree of the reaction network, instead of the overall network size. The resulting complexity reduction is assessed by studying a range of medium-and large-scale biochemical reaction networks. To evaluate the approximation accuracy and the improvement in computational efficiency, we study models for JAK2/STAT5 signalling and NFjB signalling. Our method is applicable to generic biochemical reaction networks and we provide an implementation, including an SBML interface, which renders the sMA easily accessible.
引用
收藏
页码:I293 / I300
页数:8
相关论文
共 50 条
  • [31] Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    Mitzenmacher, Michael
    Pachocki, Jakub
    Peng, Richard
    Tsourakakis, Charalampos E.
    Xu, Shen Chen
    KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, : 815 - 824
  • [32] A moment closure method for stochastic reaction networks
    Lee, Chang Hyeong
    Kim, Kyeong-Hun
    Kim, Pilwon
    JOURNAL OF CHEMICAL PHYSICS, 2009, 130 (13):
  • [33] Replicated Computational Results (RCR) Report for "Automatic Moment-Closure Approximation of Spatially Distributed Collective Adaptive Systems"
    Lueck, Alexander
    ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION, 2016, 26 (04):
  • [34] Reconstructing Large-scale Cellular Networks Using a Sparse Approximation Approach
    Zhang, Wanhong
    Zhang, Yan
    Zhou, Tong
    IFAC PAPERSONLINE, 2015, 48 (28): : 251 - 256
  • [35] Decentralized Search for Shortest Path Approximation in Large-scale Complex Networks
    Lu, Zheng
    Feng, Yunhe
    Cao, Qing
    2017 9TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM), 2017, : 130 - 137
  • [36] LARGE-SCALE URBAN MODELING - CLOSURE
    HELWEG, OJ
    JOURNAL OF THE URBAN PLANNING & DEVELOPMENT DIVISION-ASCE, 1981, 107 (01): : 53 - 53
  • [37] THE PERCEPTION OF LARGE-SCALE TONAL CLOSURE
    COOK, N
    MUSIC PERCEPTION, 1987, 5 (02): : 197 - 205
  • [38] Scalable influence maximization for independent cascade model in large-scale social networks
    Chi Wang
    Wei Chen
    Yajun Wang
    Data Mining and Knowledge Discovery, 2012, 25 : 545 - 576
  • [39] A scalable joint routing and scheduling scheme for large-scale wireless sensor networks
    Chae, Sung-Yoon
    Kang, Kyungran
    Cho, Young-Jong
    AD HOC NETWORKS, 2013, 11 (01) : 427 - 441
  • [40] On scalable modeling of TCP congestion control mechanism for large-scale IP networks
    Ohsaki, H
    Ujiie, J
    Imase, M
    2005 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS, 2005, : 361 - 368