Inferring dynamic genetic networks with low order independencies.
In this paper, we introduce a novel inference method for dynamic genetic networks which makes it possible to face a number of time measurements n that is much smaller than the number of genes p. The approach is based on the concept of a low order conditional dependence graph that we extend here in the case of dynamic Bayesian networks. Most of our results are based on the theory of graphical models associated with the directed acyclic graphs (DAGs). In this way, we define a minimal DAG G which describes exactly the full order conditional dependencies given in the past of the process. Then, to face with the large p and small n estimation case, we propose to approximate DAG G by considering low order conditional independencies. We introduce partial qth order conditional dependence DAGs G(q) and analyze their probabilistic properties. In general, DAGs G(q) differ from DAG G but still reflect relevant dependence facts for sparse networks such as genetic networks. By using this approximation, we set out a non-Bayesian inference method and demonstrate the effectiveness of this approach on both simulated and real data analysis. The inference procedure is implemented in the R package 'G1DBN' freely available from the R archive (CRAN).
Lèbre
Sophie
S
Laboratoire Statistique et Genome, UMR CNRS 8071, Université d'Evry-Val-D'Essonne. s.lebre@imperial.ac.uk
D000465:Algorithms; D001499:Bayes Theorem; D003198:Computer Simulation; D053263:Gene Regulatory Networks; D008957:Models, Genetic; D020411:Oligonucleotide Array Sequence Analysis; D015203:Reproducibility of Results; D012441:Saccharomyces cerevisiae; D013997:Time Factors