Jove
Visualize
联系我们
JoVE
x logofacebook logolinkedin logoyoutube logo
关于 JoVE
概览领导团队博客JoVE 帮助中心
作者
出版流程编辑委员会范围与政策同行评审常见问题投稿
图书馆员
用户评价订阅访问资源图书馆顾问委员会常见问题
研究
JoVE JournalMethods CollectionsJoVE Encyclopedia of Experiments存档
教育
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab Manual教师资源中心教师网站
使用条款与条件
隐私政策
政策

相关概念视频

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

您也可能阅读

相关文章

通过共同作者、期刊和引用图与本文相关的文章。

排序
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

相关实验视频

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加速了GWAS变换测试的测试.

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
概括

这项研究引入了一种基于FPGA的工具,以加快全基因组关联研究 (GWAS) 的变异测试. 这种新的方法大大减少了识别复杂特征的遗传联系的计算时间.

更多相关视频

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

相关实验视频

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

科学领域:

  • 计算生物学 计算生物学
  • 遗传学 是一个遗传学.
  • 高性能计算 高性能计算

背景情况:

  • 全基因组关联研究 (GWAS) 识别与复杂特征相关的遗传变异 (SNP).
  • 在GWAS中,大量的数据集会造成多重测试问题,增加假阳性风险.
  • 转换测试可以准确地控制假阳性,但对于大型GWAS数据集来说,它是计算密集的.

研究的目的:

  • 开发和评估一个基于FPGA的工具来加速GWAS排列测试.
  • 为了实现该工具在AWS EC2实例上的云部署,以实现广泛的可访问性.
  • 显著提高GWAS中连续表型的变异测试的速度.

主要方法:

  • 实现基于FPGA的工具,包括maxT和自适应变量测试算法.
  • 使用AWS EC2实例实现可扩展性和可访问性的云部署策略.
  • 使用大型乳腺癌数据集 (137万SNP,3,652人) 与PLINK进行性能比较.

主要成果:

  • 与基于CPU的PLINK相比,在GWAS排列测试中证明了大量的加快速度.
  • 对于1000个maxT排列实现了22分钟的分析,而对于PLINK则是7天.
  • 在325分钟内完成了1亿次自适应变换,比PLINK的8.5天要快得多.
  • 在33小时内成功处理了7亿个自适应变换,这项任务需要CPU一个多月的时间.

结论:

  • 基于FPGA的工具为GWAS排列测试提供了数量级的性能改进.
  • 为遗传关联研究提供可访问,高性能计算,而不需要专门的硬件专业知识.
  • 有助于更有效,更快速地识别具有复杂特征的遗传关联.