findBestNpvs: Quickly Find N Smallest P-values in a Long Vector

In andreyshabalin/ramwas: Fast Methylome-Wide Association Study Pipeline for Enrichment Platforms

Description

Finding top, say, 100 p-values out of millions can be slow. This function does it much faster than the usual application of order(pv)[1:N].

Usage

findBestNpvs(pv, n)

Arguments

pv	Vector of p-values.
n	Number of best p-values to select.

Details

The function is a faster analog of sort(order(pv)[1:N])

Value

Return a vector of positions of the smallest N p-values in pv.

Author(s)

Andrey A Shabalin [e-mail]

See Also

See order.

Examples

pv = runif(1000)^10
n = 100

# Faster version
topSites1 = findBestNpvs(pv, n)

# Slow alternative
topSites2 = sort(order(pv)[1:n])

# The results must match
stopifnot(all( topSites1 == topSites2 ))

andreyshabalin/ramwas documentation built on Sept. 27, 2021, 7:25 p.m.