Description Usage Arguments Value
View source: R/xnnet_functions_v0.1.R
Size constrained weighted set cover problem to find top N sets while maximizing the coverage of all elements.
1 | reduce_GSEA_results(GSEA_results, topN = 10)
|
GSEA_results |
GSEA results (output of get_GSEA_results) |
topN |
The number of sets (or less when it completes early) to return. |
A list of topSets
and coverage
.
A list of set IDs.
The percentage of IDs covered in the top sets.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.