Related Experiment Video
Updated: Sep 16, 2025

Semiconductor Sequencing for Preimplantation Genetic Testing for Aneuploidy
Published on: August 25, 2019
FPGA acceleration of GWAS permutation testing
Yaniv Swiel1,2, Jean-Tristan Brandenburg2, Mahtaab Hayat2,3
1School of Electrical & Information Engineering, University of the Witwatersrand, Johannesburg, 2050, South Africa.
None:
Genome-wide association studies (GWASs) analyse genetic variation across many individuals to identify single-nucleotide polymorphisms (SNPs) associated with complex traits. They typically include millions of SNPs from thousands of individuals, creating a multiple testing problem where the probability of false associations increases with the number of SNPs tested. While permutation testing provides accurate control of false positive rates, it is computationally expensive and slow for large datasets. This research presents an FPGA-based tool designed for cloud deployment on AWS EC2 instances that significantly accelerates GWAS permutation testing for continuous phenotypes. The tool implements two algorithms: maxT and adaptive permutation testing. Performance comparisons using a breast cancer dataset (13.7 million SNPs from 3652 individuals) showed large speedups over PLINK running on 40 CPU cores. For 1000 maxT permutations, the FPGA tool completed analysis in 22 min versus PLINK's 7 days. For 100 million adaptive permutations, FPGA required 325 min compared to PLINK's 8.5 days. The tool handled 700 million adaptive permutations in 33 h-a workload which would require over a month for CPU-based analysis. FPGA solution provides accessible, order-of-magnitude performance improvements without requiring FPGA expertise or dedicated cluster access.
Related Concept Videos
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
Wald-Wolfowitz Runs Test I
The test works...
Genome-wide Association Studies-GWAS
GWAS does not require the identification of the target gene involved in...
Fast Fourier Transform
The computational efficiency of the FFT becomes...

