MSET {SuperExactTest}

Exact Test of Multi-Set Intersection

Description

Calculate FE and significance of intersection among multiple sets.

Usage

MSET(x,n,lower.tail=TRUE,log.p=FALSE)

Arguments

x

list; a collection of sets.

n

integer; background population size.

lower.tail

logical; if TRUE, probability is P[overlap < m], otherwise, P[overlap >= m], where m is the number of elements overlap between all sets.

log.p

logical; if TRUE, probability p is given as log(p).

Details

This function implements an efficient statistical test for multi-set intersections. The algorithm behind this function was described in Wang et al 2015.

Value

A list with the following elements:

intersects

a vector of intersect items.

FE

fold enrichment of the intersection.

p.value

one-tail probability of observing equal to or larger than the number of intersect items.

Author(s)

Minghui Wang <[e-mail]>, Bin Zhang <[e-mail]>

References

Minghui Wang, Yongzhong Zhao, and Bin Zhang (2015). Efficient Test and Visualization of Multi-Set Intersections. Scientific Reports 5: 16923.

See Also

supertest, cpsets, dpsets

Examples

## Not run: 
#set up fake data
x=list(S1=letters[1:20], S2=letters[10:26], S3=sample(letters,10), S4=sample(letters,10))
MSET(x, 26, FALSE)

## End(Not run)