Empirical Bayes Conditional Independence Graphs for Dense Regulatory Network Recovery

Motivation: Computational inference methods that make use of graphical models to extract regulatory networks from gene expression data can have difficulty reconstructing dense regions of a network, a consequence of both computational complexity and unreliable parameter estimation when sample size is small. As a result, identification of hub genes is of special difficulty for these methods.Methods: We present a new algorithm, Empirical Light Mutual Min (ELMM), for large network reconstruction that has properties well suited for dense graph recovery. ELMM reconstructs the undirected graph of a regulatory network using empirical Bayes conditional independence testing with a heuristic relaxation of independence constraints in dense areas of the graph. This relaxation allows only one gene of a pair with a putative relation to be aware of the network connection, an approach that is aimed at easing multiple testing problems associated with recovering densely connected structures.Results: Using in silico data, we show that ELMM has better performance than commonly used network inference algorithms including PC Algorithm, GeneNet, and ARACNE. We also apply ELMM to reconstruct a network among 5,400 genes expressed in human lung airway epithelium of healthy nonsmokers, healthy smokers, and smokers with pulmonary diseases assayed using microarrays. The analysis identifies dense subnetworks that are consistent with known regulatory relationships in the lung airway and also suggests novel hub regulatory relationships among a number of genes that play roles in oxidative stress, wound response, and secretion. We present a new approach to extracting regulatory networks from gene expression data. The algorithm is applied to reconstruct the gene regulatory network in human lung airway epithelium using microarray data extracted from healthy nonsmokers and smokers and smokers with pulmonary diseases.