BLINK: A Package for Next Level of Genome Wide Association Studies with Both Individuals and Markers in Millions
Meng HuangiD, Xiaolei LiuiD, Yao ZhouiD, Ryan M Summers, Zhiwu ZhangiD
Abstract
Big data, accumulated from biomedical and agronomic studies, provides the potential to identify genes controlling complex human diseases and agriculturally important traits through genome-wide association studies (GWAS). However, big data also leads to extreme computational challenges, especially when sophisticated statistical models are employed to simultaneously reduce false positives and false negatives. The newly developed Fixed and random model Circulating Probability Unification (FarmCPU) method uses a bin method under the assumption that Quantitative Trait Nucleotides (QTNs) are evenly distributed throughout the genome. The estimated QTNs are used to separate a mixed linear model into a computationally efficient fixed effect model (FEM) and a computationally expensive random effect model (REM), which are then used iteratively. To completely eliminate the computationally expensive REM, we replaced REM with FEM by using Bayesian information criteria. To eliminate the requirement that QTNs be evenly distributed throughout the genome, we replaced the bin method with linkage disequilibrium information. The new method is called Bayesian-information and Linkage-disequilibrium Iteratively Nested Keyway (BLINK). Both real and simulated data analyses demonstrated that BLINK improves statistical power compared to FarmCPU, in addition to a remarkable improvement in computing time. Now, a dataset with half million markers and one million individuals can be analyzed within five hours, compared with one week using FarmCPU.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 871
- FWCI
- 11.65
- Field percentile
- top 1%
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- FarmCPUpp: Efficient Large-Scale GWAS
Aaron Kusmec, Patrick S. Schnable·Plant DirectPeer-reviewed·Apr 1, 2018
- Mixed model association for biobank-scale data sets
Po‐Ru Loh, Gleb Kichaev, … Alkes L. Price·Nature GeneticsPeer-reviewed·Jun 8, 2018
- A fast mrMLM algorithm for multi-locus genome-wide association studies
Cox Lwaka Tamba, Yuan‐Ming Zhang·bioRxiv·Jun 7, 2018
- GWAS-Flow: A GPU accelerated framework for efficient permutation based genome-wide association studies
Jan A. Freudenthal, Markus Johannes Ankenbrand, … Arthur Korte·bioRxiv·Sep 27, 2019
- A comprehensive overview and benchmarking analysis of fast algorithms for genome-wide association studies
Fang Liu, Jie Zhang, … Yong Jiang·bioRxiv·Dec 5, 2023
- Computationally efficient whole genome regression for quantitative and binary traits
Joelle S. Mbatchou, Leland Barnard, … Jonathan Marchini·Nature GeneticsPeer-reviewed·May 20, 2021