Applying dynamic Bayesian networks to perturbed gene expression data

• Published in: BMC bioinformatics 2006-05, Vol.7 (1), p.249-249, Article 249
• Main Authors: Dojer, Norbert, Gambin, Anna, Mizera, Andrzej, Wilczyński, Bartek, Tiuryn, Jerzy
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial Intelligence; Bayes Theorem; Computer Simulation; Gene Expression - physiology; Gene Expression Profiling - methods; Methodology; Models, Biological; Models, Statistical; Oligonucleotide Array Sequence Analysis - methods; Pattern Recognition, Automated - methods; Proteome - metabolism; Signal Transduction - physiology
• ISSN: 1471-2105; 1471-2105
• DOI: 10.1186/1471-2105-7-249

A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics, allowing to deal with the stochastic aspects of gene expressions and noisy measurements in a natural way, Bayesian networks appear attractive in the field of inferring gene interactions structure from microarray experiments data. However, the basic formalism has some disadvantages, e.g. it is sometimes hard to distinguish between the origin and the target of an interaction. Two kinds of microarray experiments yield data particularly rich in information regarding the direction of interactions: time series and perturbation experiments. In order to correctly handle them, the basic formalism must be modified. For example, dynamic Bayesian networks (DBN) apply to time series microarray data. To our knowledge the DBN technique has not been applied in the context of perturbation experiments. We extend the framework of dynamic Bayesian networks in order to incorporate perturbations. Moreover, an exact algorithm for inferring an optimal network is proposed and a discretization method specialized for time series data from perturbation experiments is introduced. We apply our procedure to realistic simulations data. The results are compared with those obtained by standard DBN learning techniques. Moreover, the advantages of using exact learning algorithm instead of heuristic methods are analyzed. We show that the quality of inferred networks dramatically improves when using data from perturbation experiments. We also conclude that the exact algorithm should be used when it is possible, i.e. when considered set of genes is small enough.