NEAT: an efficient network enrichment analysis test. Issue 1 (December 2016)

• Record Type: Journal Article
• Authors: Signorelli, Mirko; Vinciotti, Veronica; Wit, Ernst
• Is Part Of: BMC bioinformatics. Volume 17:Issue 1(2016)
• Page Start: 1
• Page End: 17
• Publication Date: 2016-12
• Subjects: Network -- Enrichment analysis -- Gene expression -- Hypergeometric; Bioinformatics -- Periodicals; Computational biology -- Periodicals; 570.285
• DOI: 10.1186/s12859-016-1203-6
• Languages: English
• ISSNs: 1471-2105

Abstract

Abstract Background Network enrichment analysis is a powerful method, which allows to integrate gene enrichment analysis with the information on relationships between genes that is provided by gene networks. Existing tests for network enrichment analysis deal only with undirected networks, they can be computationally slow and are based on normality assumptions. Results We propose NEAT, a test for network enrichment analysis. The test is based on the hypergeometric distribution, which naturally arises as the null distribution in this context. NEAT can be applied not only to undirected, but to directed and partially directed networks as well. Our simulations indicate that NEAT is considerably faster than alternative resampling-based methods, and that its capacity to detect enrichments is at least as good as the one of alternative tests. We discuss applications of NEAT to network analyses in yeast by testing for enrichment of the Environmental Stress Response target gene set with GO Slim and KEGG functional gene sets, and also by inspecting associations between functional sets themselves. Conclusions NEAT is a flexible and efficient test for network enrichment analysis that aims to overcome some limitations of existing resampling-based tests. The method is implemented in theR packageneat, which can be freely downloaded from CRAN (https://cran.r-project.org/package=neat ).