Calculate FE and significance of intersection among multiple sets.
MSET(x,n,lower.tail=TRUE,log.p=FALSE)
list; a collection of sets.
integer; background population size.
logical; if TRUE, probability is P[overlap < m]
, otherwise,
P[overlap >= m]
, where m
is the number of elements overlap between all sets.
logical; if TRUE, probability p is given as log(p).
A list with the following elements:
a vector of intersect items.
fold enrichment of the intersection.
one-tail probability of observing equal to or larger than the number of intersect items.
This function implements an efficient statistical test for multi-set intersections. The algorithm behind this function was described in Wang et al 2015.
Minghui Wang, Yongzhong Zhao, and Bin Zhang (2015). Efficient Test and Visualization of Multi-Set Intersections. Scientific Reports 5: 16923.
# 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)
# }
Run the code above in your browser using DataLab