Growing Bayesian network models of gene networks from seed genes
1Computational Biology, Department of Physics and Measurement Technology, Linköping University 581 83 Linköping, Sweden
2Center for Genomics and Bioinformatics, Karolinska Institutet 171 77 Stockholm, Sweden
*To whom correspondence should be addressed.
Motivation: For the last few years, Bayesian networks (BNs) have received increasing attention from the computational biology community as models of gene networks, though learning them from gene-expression data is problematic. Most gene-expression databases contain measurements for thousands of genes, but the existing algorithms for learning BNs from data do not scale to such high-dimensional databases. This means that the user has to decide in advance which genes are included in the learning process, typically no more than a few hundreds, and which genes are excluded from it. This is not a trivial decision. We propose an alternative approach to overcome this problem.
Results: We propose a new algorithm for learning BN models of gene networks from gene-expression data. Our algorithm receives a seed gene S and a positive integer R from the user, and returns a BN for the genes that depend on S such that less than R other genes mediate the dependency. Our algorithm grows the BN, which initially only contains S, by repeating the following step R + 1 times and, then, pruning some genes; find the parents and children of all the genes in the BN and add them to it. Intuitively, our algorithm provides the user with a window of radius R around S to look at the BN model of a gene network without having to exclude any gene in advance. We prove that our algorithm is correct under the faithfulness assumption. We evaluate our algorithm on simulated and biological data (Rosetta compendium) with satisfactory results.
Contact: jmp{at}ifm.liu.se
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  X. Sun and P. Hong Computational modeling of Caenorhabditis elegans vulval induction Bioinformatics, July 1, 2007; 23(13): i499 - i507. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
X.-w. Chen, G. Anantha, and X. Wang An effective structure learning method for constructing gene networks Bioinformatics, June 1, 2006; 22(11): 1367 - 1374. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 P. Larranaga, B. Calvo, R. Santana, C. Bielza, J. Galdiano, I. Inza, J. A. Lozano, R. Armananzas, G. Santafe, A. Perez, et al. Machine learning in bioinformatics Brief Bioinform, March 1, 2006; 7(1): 86 - 112. [Abstract] [Full Text] [PDF]
|
|