MIIC online: A web server to reconstruct causal or non-causal networks from non-perturbative data

12Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a web server running the MIIC algorithm, a network learning method combining constraint-based and information-theoretic frameworks to reconstruct causal, non-causal or mixed networks from non-perturbative data, without the need for an a priori choice on the class of reconstructed network. Starting from a fully connected network, the algorithm first removes dispensable edges by iteratively subtracting the most significant information contributions from indirect paths between each pair of variables. The remaining edges are then filtered based on their confidence assessment or oriented based on the signature of causality in observational data. MIIC online server can be used for a broad range of biological data, including possible unobserved (latent) variables, from single-cell gene expression data to protein sequence evolution and outperforms or matches state-of-the-art methods for either causal or non-causal network reconstruction.

Cite

CITATION STYLE

APA

Sella, N., Verny, L., Uguzzoni, G., Affeldt, S., & Isambert, H. (2018). MIIC online: A web server to reconstruct causal or non-causal networks from non-perturbative data. In Bioinformatics (Vol. 34, pp. 2311–2313). Oxford University Press. https://doi.org/10.1093/bioinformatics/btx844

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free