Genome-wide association studies (GWAS) are computationally intensive, requiring significant time and resources with computational complexity scaling at least linearly with sample size. Here, we present an accurate and resource-efficient pipeline for GWAS that mitigates the impact of sample size on computational demands. Our approach involves (1) randomly partitioning the cohort into equally sized sub-cohorts, (2) conducting independent GWAS within each sub-cohort, and (3) integrating the results using a novel meta-analysis technique that accounts for population structure and other confounders between sub-cohorts. Importantly, we demonstrate through simulations and real-data examples in humans that our approach effectively manages analyzing related individuals, a critical factor in real datasets, while controlling for inflated effect sizes, a phenomenon known as winner's curse. We show that our method achieves the same discovery levels as standard approaches but with significantly reduced computational costs. Additionally, it is well-suited for incremental GWAS as new samples are added over time. Our implementation within a bioinformatics workflow management system enhances reproducibility and scalability.
18 August 2023 in Journal of Mathematical Analysis and Applications
Can you stretch and reform a curve such that it fills a square completely? This question dates back to the late 19th century—the origin of space-filling curves. It was proven affirmatively by many great mathematicians. In this document, we reconsider the problem and present a different proof using the Cartesian product of Fibonacci substitution with itself. Our construction differs from other curves by the particular ordering produced by the Cartesian product of Fibonacci substitutions and the iterative geometric design induced by it.