| Title: | Efficient haplotype matching between a query and a panel for genealogical search |
| Journal: | Bioinformatics |
| Published: | 5 Jul 2019 |
| Pubmed: | https://pubmed.ncbi.nlm.nih.gov/31510689/ |
| DOI: | https://doi.org/10.1093/bioinformatics/btz347 |
| URL: | https://academic.oup.com/bioinformatics/article-pdf/35/14/i233/28913756/btz347.pdf |
Publication 4766
WARNING: the interactive features of this website use CSS3, which your browser does not support. To use the full features of this website, please update your browser.
Abstract
MOTIVATION: With the wide availability of whole-genome genotype data, there is an increasing need for conducting genetic genealogical searches efficiently. Computationally, this task amounts to identifying shared DNA segments between a query individual and a very large panel containing millions of haplotypes. The celebrated Positional Burrows-Wheeler Transform (PBWT) data structure is a pre-computed index of the panel that enables constant time matching at each position between one haplotype and an arbitrarily large panel. However, the existing algorithm (Durbin's Algorithm 5) can only identify set-maximal matches, the longest matches ending at any location in a panel, while in real genealogical search scenarios, multiple 'good enough' matches are desired.RESULTS: In this work, we developed two algorithmic extensions of Durbin's Algorithm 5, that can find all L-long matches, matches longer than or equal to a given length L, between a query and a panel. In the first algorithm, PBWT-Query, we introduce 'virtual insertion' of the query into the PBWT matrix of the panel, and then scanning up and down for the PBWT match blocks with length greater than L. In our second algorithm, L-PBWT-Query, we further speed up PBWT-Query by introducing additional data structures that allow us to avoid iterating through blocks of incomplete matches. The efficiency of PBWT-Query and L-PBWT-Query is demonstrated using the simulated data and the UK Biobank data. Our results show that our proposed algorithms can detect related individuals for a given query efficiently in very large cohorts which enables a fast on-line query search.
AVAILABILITY AND IMPLEMENTATION: genome.ucf.edu/pbwt-query.
SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
4 Authors
- Ardalan Naseri
- Erwin Holzhauser
- Degui Zhi
- Shaojie Zhang
Enabling scientific discoveries that improve human health