Fast calculation of pairwise mutual information for gene regulatory network reconstruction

Authors:
Peng Qiu;Andrew J. Gentles;Sylvia K. Plevritis
Affiliations:
Department of Radiology, Stanford University, Stanford, CA, United States;Department of Radiology, Stanford University, Stanford, CA, United States;Department of Radiology, Stanford University, Stanford, CA, United States
Venue:
Computer Methods and Programs in Biomedicine
Year:
2009

Citing 3
Cited 1

Information-theoretic inference of large transcriptional regulatory networks

EURASIP Journal on Bioinformatics and Systems Biology
Inferring Connectivity of Genetic Regulatory Networks Using Information-Theoretic Criteria

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximating discrete probability distributions with dependence trees

IEEE Transactions on Information Theory

Pairwise Element Computation with MapReduce

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new software implementation to more efficiently compute the mutual information for all pairs of genes from gene expression microarrays. Computation of the mutual information is a necessary first step in various information theoretic approaches for reconstructing gene regulatory networks from microarray data. When the mutual information is estimated by kernel methods, computing the pairwise mutual information is quite time-consuming. Our implementation significantly reduces the computation time. For an example data set of 336 samples consisting of normal and malignant B-cells, with 9563 genes measured per sample, the current available software for ARACNE requires 142 hours to compute the mutual information for all gene pairs, whereas our algorithm requires 1.6 hours. The increased efficiency of our algorithm improves the feasibility of applying mutual information based approaches for reconstructing large regulatory networks.