Skip to main content
Fig. 1 | BMC Bioinformatics

Fig. 1

From: Optimized permutation testing for information theoretic measures of multi-gene interactions

Fig. 1

a Computation time as a function of the number of permutations \(N_p\), for a synthetic dataset with a fixed number of individuals \(n=10{,}000\) and 100 k SNPs. Both direct permutations (in blue) and our method (in orange) are \(\mathcal {O}(N_p)\) (note that the horizontal axis is logarithmic, and the best fit lines plotted here are indeed linear). Our method is faster by a factor of over \(10^3\) per permutation. b Computation time as a function of the number of individuals n, for a synthetic dataset with a fixed number of permutations \(N_p=20\) and 100 k SNPs. Direct permutation is \(\mathcal {O}(n)\) but our approach is \(\mathcal {O}(1)\) (i.e. computation time does not depend on the number of samples for this approach)

Back to article page