Taming the complexity of biological pathways through parallel computing

被引:22
作者
Ballarini, Paolo [1 ,2 ]
Guido, Rosita [3 ]
Mazza, Tommaso [4 ]
Prandi, Davide [4 ]
机构
[1] Univ Liverpool, Liverpool L69 3BX, Merseyside, England
[2] Univ Glasgow, Glasgow G12 8QQ, Lanark, Scotland
[3] Univ Calabria, I-87030 Commenda Di Rende, Italy
[4] Univ Catanzaro, Catanzaro, Italy
关键词
ODE numerical solutions; stochastic simulation; model checking; parallel computing; biological pathways; STOCHASTIC SIMULATION; SYSTEMS; MODEL; NETWORKS;
D O I
10.1093/bib/bbp020
中图分类号
Q5 [生物化学];
学科分类号
070307 [化学生物学];
摘要
Biological systems are characterised by a large number of interacting entities whose dynamics is described by a number of reaction equations. Mathematical methods for modelling biological systems are mostly based on a centralised solution approach: the modelled system is described as a whole and the solution technique, normally the integration of a system of ordinary differential equations (ODEs) or the simulation of a stochastic model, is commonly computed in a centralised fashion. In recent times, research efforts moved towards the definition of parallel/distributed algorithms as a means to tackle the complexity of biological models analysis. In this article, we present a survey on the progresses of such parallelisation efforts describing the most promising results so far obtained.
引用
收藏
页码:278 / 288
页数:11
相关论文
共 63 条
[1]
ParalleloGAM: a parallel code for ODEs [J].
Amodio, P ;
Brugnano, L .
APPLIED NUMERICAL MATHEMATICS, 1998, 28 (2-4) :95-106
[2]
Parallel solution in time of ODEs: some achievements and perspectives [J].
Amodio, Pierluigi ;
Brugnano, Luigi .
APPLIED NUMERICAL MATHEMATICS, 2009, 59 (3-4) :424-435
[3]
BOINC: A system for public-resource computing and storage [J].
Anderson, DP .
FIFTH IEEE/ACM INTERNATIONAL WORKSHOP ON GRID COMPUTING, PROCEEDINGS, 2004, :4-10
[4]
[Anonymous], 2001, Foundations of Systems Biology
[5]
[Anonymous], 2003, The SPIN Model Checker
[6]
[Anonymous], 1994, Introduction to the Numerical Solutions of Markov Chains
[7]
AOUAD LM, 2005, P 6 IEEE INT C CLUST
[8]
AZIZ A, 1996, ACM T COMPUT LOG, V1, P162
[9]
Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
[10]
Model-checking algorithms for continuous-time Markov chains [J].
Baier, C ;
Haverkort, B ;
Hermanns, H ;
Katoen, JP .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2003, 29 (06) :524-541