z-logo
open-access-imgOpen Access
RAFFI: Accurate and fast familial relationship inference in large scale biobank studies using RaPID
Author(s) -
Ardalan Naseri,
Junjie Shi,
Xihong Lin,
Shaojie Zhang,
Degui Zhi
Publication year - 2021
Publication title -
plos genetics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.587
H-Index - 233
eISSN - 1553-7404
pISSN - 1553-7390
DOI - 10.1371/journal.pgen.1009315
Subject(s) - biobank , inference , genotyping , pairwise comparison , genome wide association study , biology , concordance , computer science , data quality , statistics , computational biology , genetics , data mining , artificial intelligence , mathematics , single nucleotide polymorphism , genotype , engineering , metric (unit) , operations management , gene
Inference of relationships from whole-genome genetic data of a cohort is a crucial prerequisite for genome-wide association studies. Typically, relationships are inferred by computing the kinship coefficients ( ϕ ) and the genome-wide probability of zero IBD sharing ( π 0 ) among all pairs of individuals. Current leading methods are based on pairwise comparisons, which may not scale up to very large cohorts (e.g., sample size >1 million). Here, we propose an efficient relationship inference method, RAFFI. RAFFI leverages the efficient RaPID method to call IBD segments first, then estimate the ϕ and π 0 from detected IBD segments. This inference is achieved by a data-driven approach that adjusts the estimation based on phasing quality and genotyping quality. Using simulations, we showed that RAFFI is robust against phasing/genotyping errors, admix events, and varying marker densities, and achieves higher accuracy compared to KING, the current leading method, especially for more distant relatives. When applied to the phased UK Biobank data with ~500K individuals, RAFFI is approximately 18 times faster than KING. We expect RAFFI will offer fast and accurate relatedness inference for even larger cohorts.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here