Learning regulatory interactions between genes from microarray measurements presents one of the major challenges in functional genomics. This article studies the suitability of learning dynamic Bayesian networks under realistic experimental settings. Through extensive artificial-data experiments, it is investigated how the performance of discovering the true interactions depends on varying data conditions. These experiments show that the performance most strongly deteriorates when the connectivity of the original network increases, and more than a proportional increase in the number of samples is needed to compensate for this. Furthermore, it was found that a lower performance is achieved when the original network size becomes larger, but this decrease can be greatly reduced with increased computational effort. Finally, it is shown that the performance of the search algorithm benefits more from a larger number of restarts rather than from the use of more sophisticated search strategies.
Get full access to this article
View all access options for this article.
References
1.
[1] van Someren, E. P., L. F. A. Wessels, M. J. T. Reinders, and E. Backer. 2001. Searching for limited connectivity in genetic network models . In Proceedings of the Second International Conference on Systems Biology, November, Pasadena, CA, pp. 222-230 .
2.
[2] van Someren, E. P., L. F. A. Wessels, M. J. T. Reinders, and E. Backer. 2002. Computational and statistical approaches to genomics. Dordrecht, the Netherlands: Kluwer .
3.
[3] Friedman, N., I. Nachman, and D. Pe’er. 1999. Learning Bayesian network structure from massive datasets: The “sparse candidate” algorithm . In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pp. 206-215 .
4.
[4] van Someren, E. P., L. F. A. Wessels, and M. J. T. Reinders. 2000. Linear modeling of genetic networks from experimental data . In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, edited by R. Altman, T. L. Bailey, P. Bourne, M. Gribskov, T. Lengauer, I. N. Shindyalov, L. F. Ten Eyck, and H. Weissig, 355-366 . La Jolla, CA: AAAI.
5.
[5] Wahde, M., and J. Hertz. 2000. Coarse-grained reverse engineering of genetic regulatory networks . Biosystems55 (1-3): 129-136 .
6.
[6] D’Haeseleer, P., X. Wen, S. Fuhrman, and R. Somogyi. 1999. Linear modeling of mrna expression levels during cns development and injury . In Pacific Symposium on Biocomputing ’99, vol. 4, 41-52 . New York: World Scientific Publishing.
7.
[7] Liang, S., S. Fuhrman, and R. Somogyi. 1998. Reveal, a general reverse engineering algorithm for inference of genetic network architectures . In Pacific Symposium on Biocomputing ’98, vol. 3, 18-29 . New York: World Scientific Publishing.
8.
[8] Hartemink, A. J., D. K. Gifford, T. S. Jaakkola, and R. A. Young. 2001. Using graphical models and genomic expression data to statistically validate models of genetic regulatory networks . In Pacific Symposium on Biocomputing 2001, vol. 6, 422-433 . New York: World Scientific Publishing.
9.
[9] Imoto, S., T. Goto, and S. Miyano. 2002. Estimation of genetic networks and functional structures between genes by using Bayesian networks and nonparametric regression . In Pacific Symposium on Biocomputing 2002, vol. 7, 175-186 . New York: World Scientific Publishing.
10.
[10] Shmulevich, I., E. R. Dougherty, and W. Zhang. 2002. Gene perturbation and intervention in probabilistic Boolean networks . Bioinformatics18 (10): 1319-1331 .
11.
[11] Gardner, T. S., D. di Bernardo, D. Lorenz, and J. J. Collins. Inferring genetic networks and identifying compound mode of action via expression profiling . Science301: 102-105 .
12.
[12] van Someren, E. P., L. F. A. Wessels, E. Backer, and M. J. T. Reinders. 2002. Genetic network modeling . Pharmacogenomics3 (4): 507-525 .
13.
[13] de Jong, H. 2002. Modeling and simulation of genetic regulatory systems: A literature review . Journal of Computational Biology9 (1): 67-103 .
14.
[14] Heckerman, D. 1998. Learning in graphical models. Dordrecht, the Netherlands: Kluwer .
15.
[15] Murphy, K., and S. Mian. 1999. Modelling gene expression data using dynamic Bayesian networks. Technical report, Computer Science Division, University of California, Berkeley .
16.
[16] McAdams, H. H., and A. Arkin. 1997. Stochastic mechanisms in gene expression . Proceedings of the National Academy of Sciences of the USA94: 814-819 .
17.
[17] Pe’er, D., A. Regev, G. Elidan, and N. Friedman. 2001. Inferring subnetworks from perturbed expression profiles . Bioinformatics1 (1): 9 .
18.
[18] Spirtes, P., C. Glymour, and R. Scheines. 2000. Constructing Bayesian network models of gene expression networks from microarray data . In Proceedings of the Atlantic Symposium on Computational Biology, Genome Information Systems and Technology.
19.
[19] Weaver, D. C., C. T. Workman, and G. D. Stormo. 1999. Modeling regulatory networks with weight matrices . In Pacific Symposium on Biocomputing ’99, vol. 4, pp. 112-123 . New York: World Scientific Publishing.
20.
[20] van Someren, E. P. 2003. Data-driven discovery of genetic network models. Ph.D. diss., Delft University of Technology, Delft, the Netherlands.
21.
[21] Friedman, N., K. Murphy, and S. Russell. 1998. Learning the structure of dynamic probabilistic networks . In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Madison, Wisconsin.
22.
[22] Spellman, P., G. Sherlock, M. Zhang, V. Iyer, K. Anders, M. Eisen, P. Brown, D. Botstein, and B. Futcher. 1998. Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization . Molecular Biology of the Cell9: 3273-3297 .
23.
[23] Kitano, H. 2001. Foundations of systems biology. Cambridge, MA: MIT Press .
24.
[24] Arnone, A., and B. Davidson. 1997. The hardwiring of development: Organization and function of genomic regulatory systems . Development124: 1851-1864 .
25.
[25] Jeong, H., S. Mason, A.-L. Barabasi, and Z. N. Oltvai. 2001. Centrality and lethality of protein networks . Nature411: 41-42 .
26.
[26] H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabasi. 2000. The large-scale organization of metabolic networks . Nature407: 651-654 .
27.
[27] Heckerman, D., and D. Geiger. Likelihoods and parameter priors for Bayesian networks. Tech. Report MSR-TR-95-54, Microsoft Research, Redmond, WA , November, 1995.
28.
[28] Friedman, N., M. Linial, I. Nachman, and D. Pe’er. 2000. Using Bayesian networks to analyze expression data . Journal of Computational Biology7 (3-4): 601-620 .
29.
[29] Cooper, G. F., and E. Herskovits. 1992. A Bayesian method for the induction of probablistic networks from data . Machine Learning9: 309-347 .
30.
[30] Chickering, D. M., and D. Heckerman. 1996. Efficient approximation for the marginal likelihood for incomplete data given a Bayesian network. Tech. Report MSR-TR-96-08, Microsoft Research, Redmond, WA .
31.
[31] Andersson, J. 2000. A survey of multiobjective optimization in engineering design. Tech. Rep. LiTH-IKP-R-1097, Department of Mechanical Engineering, Linköping University, Linköping, Sweden .
32.
[32] Gardner, K. A., J. Rine, and C. A. Fox. 1999. A region of the sir1 protein dedicated to recognition of a silencer and required for interaction with the orc1 protein in Saccharomyces cerevisiae . Genetics151: 31-44 .
33.
[33] Barbaric, S., H. Reinke, and W. Horz. 2003. Multiple mechanistically distinct functions of saga at the pho5 promoter . Molecular Cellular Biology23 (10): 3468-3476 .
34.
[34] Wingender, E., X. Chen, R. Hehl, H. Karas, I. Liebich, V. Matys, T. Meinhardt, M. Prüss, I. Reuter, and F. Schacherer. 2000. Transfac: An integrated system for gene expression regulation . Nucleic Acids Research28: 316-319 .
35.
[35] Friedman, N., M. Goldszmidt, and A. Wyner. 1999. Data analysis with Bayesian networks: A bootstrap approach . In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence.
