Please use this identifier to cite or link to this item: https://doi.org/10.1145/2037509.2037516
Title: A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways
Authors: Palaniappan, S.K.
Akshay, S.
Genest, B.
Thiagarajan, P.S. 
Issue Date: 2011
Source: Palaniappan, S.K.,Akshay, S.,Genest, B.,Thiagarajan, P.S. (2011). A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways. Proceedings of the 9th International Conference on Computational Methods in Systems Biology, CMSB'11 : 35-44. ScholarBank@NUS Repository. https://doi.org/10.1145/2037509.2037516
Abstract: Dynamic Bayesian Networks (DBNs) can serve as succinct models of large biochemical networks [19]. To analyze these models, one must compute the probability distribution over system states at a given time point. Doing this exactly is infeasible for large models and hence approximate methods are needed. The Factored Frontier algorithm (FF) is a simple and efficient approximate algorithm [25] that has been designed to meet this need. However the errors it incurs can be quite large. The earlier Boyen-Koller (BK) algorithm [3] can also incur significant errors. To address this, we present here a novel approximation algorithm called the Hybrid Factored Frontier (HFF) algorithm. HFF may be viewed as a parametrized version of FF. At each time slice, in addition to maintaining probability distributions over local states -as FF does- we also maintain explicitly the probabilities of a small number of global states called spikes. When the number of spikes is 0, we get FF and with all global states as spikes, we get the - computationally infeasible- exact inference algorithm. We show that by increasing the number of spikes one can reduce errors while the additional computational effort required is only quadratic in the number of spikes. We have validated the performance of our algorithm on large DBN models of biopathways. Each pathway has more than 30 species and the corresponding DBN has more than 3000 nodes. Comparisons with the performances of FF and BK show that HFF can be a useful and powerful approximation algorithm for analyzing DBN models of biopathways. © 2011 ACM.
Source Title: Proceedings of the 9th International Conference on Computational Methods in Systems Biology, CMSB'11
URI: http://scholarbank.nus.edu.sg/handle/10635/39901
ISBN: 9781450308175
DOI: 10.1145/2037509.2037516
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 13, 2017

Page view(s)

59
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.