GSEA preranked analysis for unsigned/one-sided gene rankings?
0
1
Entering edit mode
5.1 years ago
keith.hughitt ▴ 280

Greetings!

I was wondering what people's thoughts are on performing a preranked GSEA type analysis on unsigned / one-sided gene statistics are?

Most of the literature / discussions I've come across tend to focus on the things like gene expression fold-change across two conditions, where a _signed_ gene ranking can be generated, e.g.

  • Fold-change, or,
  • Sign(fold-change) * -log10(P-value)

In some situations, however, it may be desirable to perform such an analysis on _unsigned_ gene rankings, to check for over-representation of some annotation on a single side of the gene rankings.

For example, given some scoring function that assigns a positive score to each gene based on some assessment of the gene's association with a phenotype of interest, it might be useful to then perform GSEA on the ranked distribution of gene scores.

In cases where I'm working with _signed_ gene metrics, fgsea has been quite useful due to it's high performance optimization and flexibility with respect to the nature of the input gene scores. However, it too expects data

I found one package(AbsGeneFilter, Yoon et al., 2016) that attempts to directly address this, however, the method is again focused on (RNA-Seq) gene expression analysis, and also lacks some of the helpful performance improvements provided by fgsea.

In theory, any of the aforementioned K-S test or permutation-based methods should also be able to detect enrichment of gene sets on a unsigned ranking such as that described above, however, I was wondering if anyone else has considered this kind of thing in terms of its implications on sensitivity / specificity of the results, or perhaps if there are other approaches that might be worth looking into?

Keith

GSEA fgsea preranked unsigned one-sided • 1.5k views
ADD COMMENT

Login before adding your answer.

Traffic: 2086 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6