Name
Abstract | ||
|---|---|---|
Biopathways are often modeled as systems of ordinary differential equations (ODEs). Such systems will usually have many unknown parameters and hence will be difficult to calibrate. Since the data available for calibration will have limited precision, an approximate representation of the ODEs dynamics should suffice. One must, however, be able to efficiently construct such approximations for large models and perform model calibration and subsequent analysis.We present a graphical processing unit (GPU) based scheme by which a system of ODEs is approximated as a dynamic Bayesian network (DBN). We then construct a model checking procedure for DBNs based on a simple probabilistic linear time temporal logic. The GPU implementation considerably extends the reach of our previous PC-cluster-based implementation (Liu et al., 2011b). Further, the key components of our algorithm can serve as the GPU kernel for other Monte Carlo simulations-based analysis of biopathway dynamics. Similarly, our model checking framework is a generic one and can be applied in other systems biology settings. We have tested our methods on three ODE models of bio-pathways: the epidermal growth factor-nerve growth factor pathway, the segmentation clock network and the MLC-phosphorylation pathway models. The GPU implementation shows significant gains in performance and scalability whereas the model checking framework turns out to be convenient and efficient for specifying and verifying interesting pathways properties.The source code is freely available at http://www.comp.nus.edu.sg/~rpsysbio/pada-gpu/ |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1093/bioinformatics/bts166 | Bioinformatics |
Keywords | Field | DocType |
ode model,approximate probabilistic analysis,odes dynamic,large model,model calibration,mlc-phosphorylation pathway model,gpu kernel,model checking framework,model checking procedure,previous pc-cluster-based implementation,biopathway dynamic,gpu implementation | Model checking,Computer science,Source code,Probabilistic analysis of algorithms,Theoretical computer science,Temporal logic,Bioinformatics,Probabilistic logic,Ode,Scalability,Dynamic Bayesian network | Journal |
Volume | Issue | ISSN |
28 | 11 | 1367-4811 |
Citations | PageRank | References |
8 | 0.48 | 22 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bing Liu | 1 | 12 | 0.95 |
| Andrei Hagiescu | 2 | 108 | 8.49 |
| Sucheendra K Palaniappan | 3 | 34 | 3.93 |
| Bipasa Chattopadhyay | 4 | 73 | 4.02 |
| Zheng Cui | 5 | 17 | 1.42 |
| Weng-fai Wong | 6 | 1019 | 83.39 |
| P. S. Thiagarajan | 7 | 1497 | 193.71 |