Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

324
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
324
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

744
The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
744
Genome-wide Association Studies-GWAS01:11

Genome-wide Association Studies-GWAS

14.4K
Genome-wide association studies or GWAS are used to identify whether common SNPs are associated with certain diseases. Suppose specific SNPs are more frequently observed in individuals with a particular disease than those without the disease. In that case, those SNPs are said to be associated with the disease. Chi-square analysis is performed to check the probability of the allele likely to be associated with the disease.
GWAS does not require the identification of the target gene involved in...
14.4K
Fast Fourier Transform01:10

Fast Fourier Transform

479
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
479

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Advocating for return-of-results to participants in microbiome research.

Nature microbiology·2026
Same author

A Stratification Method for Identifying Subgroups at High-Risk for Type 2 Diabetes in sub-Saharan Africa.

Nature communications·2026
Same author

Participant engagement and feedback in microbiome projects: a case of AWI-Gen 2.

bioRxiv : the preprint server for biology·2026
Same author

Lifestyle and Environmental Risk Factors for Esophageal Squamous Cell Carcinoma: Evidence From the Johannesburg Cancer Study.

JCO global oncology·2026
Same author

Discovery of gene-alcohol interaction loci influencing blood pressure in 1.1 million individuals from multiple populations.

Research square·2026
Same author

Association of Family History and Polygenic Risk Scores With Prostate Cancer in Africa.

JCO global oncology·2026
Same journal

Region-aware bridge modeling enables interpretable mesoscale representation of spatial transcriptomic tissue sections.

Bioinformatics advances·2026
Same journal

Microbiome differential abundance methodologies to detect relevant taxa associated with chemotherapy toxicity rate in colorectal cancer.

Bioinformatics advances·2026
Same journal

maldipickr dereplicates microbial MALDI-TOF spectra to facilitate multiplexed isolation.

Bioinformatics advances·2026
Same journal

RAM-MSA: an anytime memory-bounded method for exact multiple sequence alignment using path finding.

Bioinformatics advances·2026
Same journal

Interpretable machine learning for low-sample multi-omics: a case study of ferret vaccine response.

Bioinformatics advances·2026
Same journal

DeepTaxa: a hybrid CNN-BERT framework for 16S rRNA taxonomic classification.

Bioinformatics advances·2026
See all related articles

Related Experiment Video

Updated: Sep 16, 2025

Semiconductor Sequencing for Preimplantation Genetic Testing for Aneuploidy
09:03

Semiconductor Sequencing for Preimplantation Genetic Testing for Aneuploidy

Published on: August 25, 2019

9.5K

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.

Bioinformatics Advances
|July 9, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces an FPGA-based tool to speed up genome-wide association studies (GWAS) permutation testing. The novel approach dramatically reduces computation time for identifying genetic links to complex traits.

More Related Videos

Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform
09:30

Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform

Published on: August 17, 2022

3.2K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.3K

Related Experiment Videos

Last Updated: Sep 16, 2025

Semiconductor Sequencing for Preimplantation Genetic Testing for Aneuploidy
09:03

Semiconductor Sequencing for Preimplantation Genetic Testing for Aneuploidy

Published on: August 25, 2019

9.5K
Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform
09:30

Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform

Published on: August 17, 2022

3.2K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.3K

Area of Science:

  • Computational Biology
  • Genetics
  • High-Performance Computing

Background:

  • Genome-wide association studies (GWASs) identify genetic variants (SNPs) linked to complex traits.
  • Large datasets in GWASs create a multiple testing problem, increasing false positive risks.
  • Permutation testing accurately controls false positives but is computationally intensive for large GWAS datasets.

Purpose of the Study:

  • To develop and evaluate an FPGA-based tool for accelerating GWAS permutation testing.
  • To enable cloud deployment of the tool on AWS EC2 instances for broad accessibility.
  • To significantly improve the speed of permutation testing for continuous phenotypes in GWAS.

Main Methods:

  • Implementation of an FPGA-based tool incorporating maxT and adaptive permutation testing algorithms.
  • Cloud deployment strategy utilizing AWS EC2 instances for scalability and accessibility.
  • Performance benchmarking against PLINK using a large breast cancer dataset (13.7 million SNPs, 3652 individuals).

Main Results:

  • Demonstrated substantial speedups for GWAS permutation testing compared to CPU-based PLINK.
  • Achieved a 22-minute analysis for 1000 maxT permutations, versus 7 days for PLINK.
  • Completed 100 million adaptive permutations in 325 minutes, significantly faster than PLINK's 8.5 days.
  • Successfully processed 700 million adaptive permutations in 33 hours, a task requiring over a month on CPUs.

Conclusions:

  • The FPGA-based tool offers order-of-magnitude performance improvements for GWAS permutation testing.
  • Provides accessible, high-performance computing for genetic association studies without requiring specialized hardware expertise.
  • Facilitates more efficient and rapid identification of genetic associations with complex traits.