%A Iacucci,Ernesto
%A Zingg,Hans
%A Perkins,Theodore
%D 2012
%J Frontiers in Genetics
%C
%F
%G English
%K depletion,Dynamic Programming,Enrichment,gene ontology,weighted membership
%Q
%R 10.3389/fgene.2012.00024
%W
%L
%N 24
%M
%P
%7
%8 2012-February-23
%9 Original Research
%+ Mr Ernesto Iacucci,KU Leuven,Leuven,Belgium,ernesto.iacucci@gmail.com
%+ Dr Theodore Perkins,Ottawa Hospital Research Institute,Ottawa,Canada,tperkins@ohri.ca
%+ Dr Theodore Perkins,University of Ottawa,Ottawa,Canada,tperkins@ohri.ca
%#
%! Enrichment or Depletion under Weighted Membership
%*
%<
%T Methods for Determining the Statistical Significance of Enrichment or Depletion of Gene Ontology Classifications under Weighted Membership
%U https://www.frontiersin.org/article/10.3389/fgene.2012.00024
%V 3
%0 JOURNAL ARTICLE
%@ 1664-8021
%X High-throughput molecular biology studies, such as microarray assays of gene expression, two-hybrid experiments for detecting protein interactions, or ChIP-Seq experiments for transcription factor binding, often result in an “interesting” set of genes – say, genes that are co-expressed or bound by the same factor. One way of understanding the biological meaning of such a set is to consider what processes or functions, as defined in an ontology, are over-represented (enriched) or under-represented (depleted) among genes in the set. Usually, the significance of enrichment or depletion scores is based on simple statistical models and on the membership of genes in different classifications. We consider the more general problem of computing p-values for arbitrary integer additive statistics, or weighted membership functions. Such membership functions can be used to represent, for example, prior knowledge on the role of certain genes or classifications, differential importance of different classifications or genes to the experimenter, hierarchical relationships between classifications, or different degrees of interestingness or evidence for specific genes. We describe a generic dynamic programming algorithm that can compute exact p-values for arbitrary integer additive statistics. We also describe several optimizations for important special cases, which can provide orders-of-magnitude speed up in the computations. We apply our methods to datasets describing oxidative phosphorylation and parturition and compare p-values based on computations of several different statistics for measuring enrichment. We find major differences between p-values resulting from these statistics, and that some statistics recover “gold standard” annotations of the data better than others. Our work establishes a theoretical and algorithmic basis for far richer notions of enrichment or depletion of gene sets with respect to gene ontologies than has previously been available.