Network Inference based on Mutual Information Applied to Microarray Data

Patrick Meyer

Date and place: Wednesday April, 27th 12:30 pm at R7 (B28 - Montefiore)

An important issue in computational biology is the extent to which it is possible to learn transcriptional interactions from measured expression data. The reverse engineering of transcriptional regulatory networks from expression data alone is challenging because of the combinatorial nature of the problem and of the limited amount of (noisy) samples available in expression datasets.

This talk will focus on information-theoretic approaches of network inference which typically rely on the estimation of mutual information and/or conditional mutual information from data in order to measure the statistical dependence between genes expressions. The adoption of mutual information in network inference can be traced back to Chow and Liu's tree algorithm. Nowadays, two main categories of information-theoretic network inference methods hold the attention of the bioinformatics community: i) methods based on bivariate mutual information that infer undirected networks up to thousands of genes thanks to their low algorithmic complexity and ii) methods based on conditional mutual information that are able to infer a larger set of relationships between genes but at the price of a higher algorithmic complexity. The strengths and weaknesses of these information-theoretic methods for inferring transcriptional networks will be detailed in this talk.