Inferring Regulatory Networks by Combining Perturbation Screens and Steady State Gene Expression Profiles

Abstract

Reconstructing transcriptional regulatory networks is an important task in functional genomics. Data obtained from experiments that perturb genes by knockouts or RNA interference contain useful information for addressing this reconstruction problem. However, such data can be limited in size and/or are expensive to acquire. On the other hand, observational data of the organism in steady state (e.g. wild-type) are more readily available, but their informational content is inadequate for the task at hand. We develop a computational approach to appropriately utilize both data sources for estimating a regulatory network. The proposed approach is based on a three-step algorithm to estimate the underlying directed but cyclic network, that uses as input both perturbation screens and steady state gene expression data. In the first step, the algorithm determines causal orderings of the genes that are consistent with the perturbation data, by combining an exhaustive search method with a fast heuristic that in turn couples a Monte Carlo technique with a fast search algorithm. In the second step, for each obtained causal ordering, a regulatory network is estimated using a penalized likelihood based method, while in the third step a consensus network is constructed from the highest scored ones. Extensive computational experiments show that the algorithm performs well in reconstructing the underlying network and clearly outperforms competing approaches that rely only on a single data source. Further, it is established that the algorithm produces a consistent estimate of the regulatory network.

24 pages, 4 figures, 6 tables

References in corpus (2)

• ARACNE: An Algorithm for the Reconstruction of Gene Regulatory Networks in a Mammalian Cellular Context
• Being Bayesian about Network Structure

Cited by in corpus (8)

• Inferring large graphs using l1-penalized likelihood
• Penalized Estimation of Directed Acyclic Graphs From Discrete Data
• The Reduced PC-Algorithm: Improved Causal Structure Learning in Large Random Networks
• Non-Asymptotic Guarantees for Reliable Identification of Granger Causality via the LASSO
• Perturbation graphs, invariant prediction and causal relations in psychology
• RIDS: Robust Identification of Sparse Gene Regulatory Networks from Perturbation Experiments
• A Posterior Probability Approach for Gene Regulatory Network Inference in Genetic Perturbation Data
• Estimation of Gaussian directed acyclic graphs using partial ordering information with an application to dairy cattle data