{"paper":{"title":"The XL-mHG Test For Enrichment: A Technical Report","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.OT","authors_text":"Florian Wagner","submitted_at":"2015-07-28T19:19:54Z","abstract_excerpt":"The minimum hypergeometric test (mHG) is a powerful nonparametric hypothesis test to detect enrichment in ranked binary lists. Here, I provide a detailed review of its definition, as well as the algorithms used in its implementation, which enable the efficient computation of an exact p-value. I then introduce a generalization of the mHG, termed XL-mHG, which provides additional control over the type of enrichment tested, and describe the precise algorithmic modifications necessary to compute its test statistic and p-value. The XL-mHG algorithm is a building block of GO-PCA, a recently proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07905","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}