Bayesian Orthogonal Least Squares (BOLS) algorithm for reverse engineering of gene regulatory networks.
BACKGROUND
A reverse engineering of gene regulatory network with large number of genes and limited number of experimental data points is a computationally challenging task. In particular, reverse engineering using linear systems is an under-determined and ill conditioned problem, i.e. the amount of microarray data is limited and the solution is very sensitive to noise in the data. Therefore, the reverse engineering of gene regulatory networks with large number of genes and limited number of data points requires rigorous optimization algorithm.


RESULTS
This study presents a novel algorithm for reverse engineering with linear systems. The proposed algorithm is a combination of the orthogonal least squares, second order derivative for network pruning, and Bayesian model comparison. In this study, the entire network is decomposed into a set of small networks that are defined as unit networks. The algorithm provides each unit network with P(D|Hi), which is used as confidence level. The unit network with higher P(D|Hi) has a higher confidence such that the unit network is correctly elucidated. Thus, the proposed algorithm is able to locate true positive interactions using P(D|Hi), which is a unique property of the proposed algorithm. The algorithm is evaluated with synthetic and Saccharomyces cerevisiae expression data using the dynamic Bayesian network. With synthetic data, it is shown that the performance of the algorithm depends on the number of genes, noise level, and the number of data points. With Yeast expression data, it is shown that there is remarkable number of known physical or genetic events among all interactions elucidated by the proposed algorithm. The performance of the algorithm is compared with Sparse Bayesian Learning algorithm using both synthetic and Saccharomyces cerevisiae expression data sets. The comparison experiments show that the algorithm produces sparser solutions with less false positives than Sparse Bayesian Learning algorithm.


CONCLUSIONS
From our evaluation experiments, we draw the conclusion as follows: 1) Simulation results show that the algorithm can be used to elucidate gene regulatory networks using limited number of experimental data points. 2) Simulation results also show that the algorithm is able to handle the problem with noisy data. 3) The experiment with Yeast expression data shows that the proposed algorithm reliably elucidates known physical or genetic events. 4) The comparison experiments show that the algorithm more efficiently performs than Sparse Bayesian Learning algorithm with noisy and limited number of data.
Kim
Chang Sik
CS
Bioinformatics Group, Turku Centre for Computer Science, Turku, Finland. cskim@kangwon.ac.kr
D000465:Algorithms; D001499:Bayes Theorem; D003198:Computer Simulation; D020869:Gene Expression Profiling / Q000379:methods*; D005786:Gene Expression Regulation / Q000502:physiology*; D008954:Models, Biological; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D012441:Saccharomyces cerevisiae / Q000378:metabolism*; D029701:Saccharomyces cerevisiae Proteins / Q000378:metabolism*; D015398:Signal Transduction / Q000502:physiology*
D029701:Saccharomyces cerevisiae Proteins