Learning causal networks with latent variables from multivariate information in genomic data.

• Main Authors: Louis Verny, Nadir Sella, Séverine Affeldt, Param Priya Singh, Hervé Isambert
• Format: Article
• Language: English
• Published: Public Library of Science (PLoS) 2017-10-01
• Series: PLoS Computational Biology
• Online Access: http://europepmc.org/articles/PMC5685645?pdf=render

Learning causal networks from large-scale genomic data remains challenging in absence of time series or controlled perturbation experiments. We report an information- theoretic method which learns a large class of causal or non-causal graphical models from purely observational data, while including the effects of unobserved latent variables, commonly found in many genomic datasets. Starting from a complete graph, the method iteratively removes dispensable edges, by uncovering significant information contributions from indirect paths, and assesses edge-specific confidences from randomization of available data. The remaining edges are then oriented based on the signature of causality in observational data. The approach and associated algorithm, miic, outperform earlier methods on a broad range of benchmark networks. Causal network reconstructions are presented at different biological size and time scales, from gene regulation in single cells to whole genome duplication in tumor development as well as long term evolution of vertebrates. Miic is publicly available at https://github.com/miicTeam/MIIC.