Reference : Parallel Approximate Steady-state Analysis of Large Probabilistic Boolean Networks
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/25935
Parallel Approximate Steady-state Analysis of Large Probabilistic Boolean Networks
English
Mizera, Andrzej mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Pang, Jun mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) > ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)]
Yuan, Qixia mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Apr-2016
Proceedings of the 31st ACM Symposium on Applied Computing
ACM
Yes
International
31st ACM Symposium on Applied Computing
from 04-04-2016 to 08-04-2016
[en] Probabilistic Boolean networks (PBNs) is a widely used computational framework for modelling biological systems. The steady-state dynamics of PBNs is of special interest in the analysis of biological machinery. However, obtaining the steady-state distributions for such systems poses a significant challenge due to the state space explosion problem which arises in the case of large PBNs. The only viable way is to use statistical methods. In the literature, the two-state Markov chain approach and the Skart method have been proposed for the analysis of large PBNs. However, the sample size required by both methods is often huge in the case of large PBNs and generating them is expensive in terms of computation time. Parallelising the sample generation is an ideal way to solve this issue. In this paper, we consider combining the Gelman & Rubin method with either the two-state Markov chain approach or the Skart method for parallelisation. The first method can be used to run multiple independent Markov chains in parallel and to control their convergence to the steady-state while the other two methods can be used to determine the sample size required for computing the steady-state probability of states of interest. Experimental results show that our proposed combinations can reduce time cost of computing stead-state probabilities of large PBNs significantly.
http://hdl.handle.net/10993/25935
FnR ; FNR7814267 > Qixia Yuan > > New Approaches to Parameter Estimation of Gene Regulatory Networks > 01/03/2014 > 14/01/2017 > 2014

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
SAC16.pdfAuthor preprint470.1 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.