RaPID-Query for fast identity by descent search and genealogical analysis
Y Wei, et al.
(2023)
Bioinformatics
- There is no summary for this article.
Abstract
Motivation
Due to the rapid growth of the genetic database size, genealogical search, a process of inferring familial relatedness by identifying DNA matches, has become a viable approach to help individuals finding missing family members or law enforcement agencies locating suspects. A fast and accurate method is needed to search an out-of-database individual against millions of individuals. Most existing approaches only offer all-versus-all within panel match. Some prototype algorithms offer one-versus-all query from out-of-panel individual, but they do not tolerate errors.
Results
A new method, random projection-based identity-by-descent (IBD) detection (RaPID) query, is introduced to make fast genealogical search possible. RaPID-Query identifies IBD segments between a query haplotype and a panel of haplotypes. By integrating matches over multiple PBWT indexes, RaPID-Query manages to locate IBD segments quickly with a given cutoff length while allowing mismatched sites. A single query against all UK biobank autosomal chromosomes was completed within 2.76 seconds on average, with the minimum length 7 cM and 700 markers. RaPID-Query achieved a 0.016 false negative rate and a 0.012 false positive rate simultaneously on a chromosome 20 sequencing panel having 86 265 sites. This is comparable to the state-of-the-art IBD detection method TPBWT(out-of-sample) and Hap-IBD. The high-quality IBD segments yielded by RaPID-Query were able to distinguish up to fourth degree of the familial relatedness for a given individual pair, and the area under the receiver operating characteristic curve values are at least 97.28%.
Availability and implementation
The RaPID-Query program is available at https://github.com/ucfcbb/RaPID-Query.
Comments are visible to all users.
Your personal notes related to this publication. These notes are only visible to you, will save automatically, and will be here when you come back.
Authors: | Y Wei, A Naseri, D Zhi, S Zhang |
Year published: | 2023 |
DOI: | 10.1093/bioinformatics/btad312 |
Full-text available: | Yes |
Journal: | Bioinformatics |
Publisher: | Oxford University Press (OUP) |

Search Controls
Log in or Register for free to adjust controls.
Adjust how much the below factors influence search score
Boost the overall effect of controls on search score

Citation
Something went wrong trying to cite the current publication. Please try again later.

Share this article

Badges

Downloads
Log in or Register for free to download citations