Fast computation of kernel statistics using genotype value decomposition
Kazuharu Misawa

TL;DR
This paper introduces a genotype value decomposition method that significantly accelerates kernel-based genetic association tests like SKAT, enabling efficient analysis of large-scale human genetic data.
Contribution
The paper presents a novel genotype value decomposition approach that reduces SKAT computation time from quadratic to linear complexity, facilitating large-scale genetic studies.
Findings
Kernel matrix can be derived from genotype value vectors.
The method reduces SKAT computation time to O(n).
Enables efficient analysis of large human genetic datasets.
Abstract
Because of the recent advances of genome sequences, a large number of human genome sequences are available for the study of human genetics. Genome-wide association studies typically focus on associations between single-nucleotide polymorphisms and traits such as major human diseases. However, the statistical power of classical single-marker association analysis for rare variants is limited. To address the challenge, rare and low-frequency variants are often grouped into a gene or pathway level, and the effects of multiple variants evaluated based on collapsing methods. The sequential kernel association test (SKAT) is one of the most effective collapsing methods. SKAT utilizes the kernel matrix. The size of the kernel matrix is O(n^2), where the sample size is n, so that the calculation of the data using the kernel method requires a long time. As the sample sizes of human genetic studies…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene expression and cancer classification · Spectroscopy and Chemometric Analyses · Genetic Mapping and Diversity in Plants and Animals
