Presentation is loading. Please wait.

Presentation is loading. Please wait.

Fig. 2. In adaptive permutation, the pool of candidate SNPs decreases as p-value estimates become more precise. Running time increases with the number.

Similar presentations


Presentation on theme: "Fig. 2. In adaptive permutation, the pool of candidate SNPs decreases as p-value estimates become more precise. Running time increases with the number."— Presentation transcript:

1 Fig. 2. In adaptive permutation, the pool of candidate SNPs decreases as p-value estimates become more precise. Running time increases with the number of permutations but is substantially faster than in exhaustive permutation From: BlueSNP: R package for highly scalable genome-wide association studies using Hadoop clusters Bioinformatics. 2012;29(1): doi: /bioinformatics/bts647 Bioinformatics | © The Author Published by Oxford University Press. All rights reserved. For Permissions, please

2 Fig. 1. BlueSNP builds upon packages and frameworks for parallel programming and big-data analytics
From: BlueSNP: R package for highly scalable genome-wide association studies using Hadoop clusters Bioinformatics. 2012;29(1): doi: /bioinformatics/bts647 Bioinformatics | © The Author Published by Oxford University Press. All rights reserved. For Permissions, please


Download ppt "Fig. 2. In adaptive permutation, the pool of candidate SNPs decreases as p-value estimates become more precise. Running time increases with the number."

Similar presentations


Ads by Google