Ensemble inference and inferability of gene regulatory networks

PLoS One. 2014 Aug 5;9(8):e103812. doi: 10.1371/journal.pone.0103812. eCollection 2014.

Abstract

The inference of gene regulatory network (GRN) from gene expression data is an unsolved problem of great importance. This inference has been stated, though not proven, to be underdetermined implying that there could be many equivalent (indistinguishable) solutions. Motivated by this fundamental limitation, we have developed new framework and algorithm, called TRaCE, for the ensemble inference of GRNs. The ensemble corresponds to the inherent uncertainty associated with discriminating direct and indirect gene regulations from steady-state data of gene knock-out (KO) experiments. We applied TRaCE to analyze the inferability of random GRNs and the GRNs of E. coli and yeast from single- and double-gene KO experiments. The results showed that, with the exception of networks with very few edges, GRNs are typically not inferable even when the data are ideal (unbiased and noise-free). Finally, we compared the performance of TRaCE with top performing methods of DREAM4 in silico network inference challenge.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Computational Biology / standards*
  • Escherichia coli / genetics
  • Forecasting
  • Gene Expression Profiling / standards*
  • Gene Expression Regulation, Bacterial
  • Gene Expression Regulation, Fungal
  • Gene Regulatory Networks*
  • Organisms, Genetically Modified
  • Reproducibility of Results
  • Research Design
  • Saccharomyces cerevisiae / genetics

Grants and funding

The work was supported by funding from the Swiss National Science Foundation (grant 137614, http://www.snf.ch). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.