Inference algorithms for gene networks: a statistical mechanics analysis

Abstract

The inference of gene regulatory networks from high throughput gene expression data is one of the major challenges in systems biology. This paper aims at analysing and comparing two different algorithmic approaches. The first approach uses pairwise correlations between regulated and regulating genes; the second one uses message-passing techniques for inferring activating and inhibiting regulatory interactions. The performance of these two algorithms can be analysed theoretically on well-defined test sets, using tools from the statistical physics of disordered systems like the replica method. We find that the second algorithm outperforms the first one since it takes into account collective effects of multiple regulators.

References in corpus (6)

• High-dimensional graphs and variable selection with the Lasso
• ARACNE: An Algorithm for the Reconstruction of Gene Regulatory Networks in a Mammalian Cellular Context
• Learning by message-passing in networks of discrete synapses
• Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels
• Statistical Mechanical Development of a Sparse Bayesian Classifier
• Gene-network inference by message passing

Cited by in corpus (18)

• Improved contact prediction in proteins: Using pseudolikelihoods to infer Potts models
• Perturbation Biology: inferring signaling networks in cellular systems
• Revealing networks from dynamics: an introduction
• On the criticality of inferred models
• Belief-Propagation and replicas for inference and learning in a kinetic Ising model with hidden spins
• Reverse Engineering Gene Networks with ANN: Variability in Network Inference Algorithms
• Revealing dynamics, communities and criticality from data
• Reconstructing the Hopfield network as an inverse Ising problem
• Inferring hidden states in Langevin dynamics on large networks: Average case performance
• Statistical mechanics of sparse generalization and model selection
• Classification and sparse-signature extraction from gene-expression data
• Beyond inverse Ising model: structure of the analytical solution for a class of inverse problems
• Sparse Hopfield network reconstruction with ${\ell }_1$ regularization
• On the typical properties of inverse problems in statistical mechanics
• Critical scaling in hidden state inference for linear Langevin dynamics
• Stability of the replica symmetric solution in diluted perceptron learning
• Ultrametric identities in glassy models of Natural Evolution
• Expectation propagation on the diluted Bayesian classifier