arrow
返回

Efficient Constant-Time Complexity Algorithm for Stochastic Simulation of Large Reaction Networks

delete2017-05-01
delete20
delete
OA
AI
V
Vo Hong Thanh *
R
Roberto Zunino
C
Corrado Priami
DOI:10.1109/TCBB.2016.2530066delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Exact stochastic simulation is an indispensable tool for a quantitative study of biochemical reaction networks. The simulation realizes the time evolution of the model by randomly choosing a reaction to fire and update the system state according to a probability that is proportional to the reaction propensity. Two computationally expensive tasks in simulating large biochemical networks are the selection of next reaction firings and the update of reaction propensities due to state changes. We present in this work a new exact algorithm to optimize both of these simulation bottlenecks. Our algorithm employs the composition-rejection on the propensity bounds of reactions to select the next reaction firing. The selection of next reaction firings is independent of the number reactions while the update of propensities is skipped and performed only when necessary. It therefore provides a favorable scaling for the computational complexity in simulating large reaction networks. We benchmark our new algorithm with the state of the art algorithms available in literature to demonstrate its applicability and efficiency.
Keyword:
Computational biology
stochastic simulation
rejection-based stochastic simulation algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

I
IEEE-ACM Transactions on Computational Biology and Bioinformatics
IF:
3.4
论文数:
3.3K
被引数:
6.4K

机构

U
University of Trento
学者数:
8.8K
论文数: 9.0K
被引数: 1.2W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
B Cell Signaling and Fate DecisionB细胞信号和命运决定
err2010-03-01
err316
PREAI
errKurosaki, Tomohiro; Shinohara, Hisaaki; Baba, Yoshihiro
err分享
err收藏
学者 查看更多内容