Scaling the PBWT for Long-Range Shared Ancestry Detection in Large Haplotype Panels
Uwaise Ibna IslamiD, Davide CozziiD, Travis GagieiD, Rahul VarkiiD, Vincenza ColonnaiD, Erik P. GarrisoniD, Paola BonizzoniiD, Christina A. BoucheriD
Abstract
Detecting long shared ancestry tracts in large haplotype panels is central to IBD analysis, imputation, and local ancestry inference, and can be approximated computationally by finding Set-Maximal Exact Matches (SMEMs) between sequences. The Positional Burrows-Wheeler Transform (PBWT) provides an efficient index for these panels, yet current methods often enumerate all SMEMs, producing a large number of short, uninformative matches. We introduce Positional Boyer- Moore-Li (PBML), which restricts enumeration to SMEMs occurring in at least k haplotypes and spanning at least L sites (kL-SMEMs). PBML is the first algorithm for computing KL-SMEMs on top of a single compressed run-length encoded PBWT index reusable for any (k, L) without rebuilding. On the 1000 Genomes Project, PBML achieves 4.6x faster query time than {micro}-PBWT and 2.4x over Durbins PBWT with lower memory, scaling to 15.9x over {micro}-PBWT at 16 threads. On a 10,000-haplotype panel from the Tennessee BIG Initiative, a diverse admixed cohort, PBML outperforms {micro}-PBWT by up to 4.7x in k-SMEM finding. By applying both thresholds during traversal, PBML extracts biologically informative, population-shared segments while filtering millions of short matches, a capability not available in current tools. On the BIG panel, in about 10 seconds PBML finds 2,441 long tracts at (k = 50, L = 5000) shared by an average of 60 haplotypes against 1000 queries, significantly reducing the 4.8 million unfiltered SMEMs shared on average by 2 haplotypes. These results establish PBML as a scalable tool for targeted long-range shared ancestry detection in large, diverse panels.
02 /Specification & Classification
Click any tag to browse matching papersReproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Syllable-PBWT for space-efficient haplotype long-match query
Victor C. Wang, Ardalan Naseri, … Degui Zhi·BioinformaticsPeer-reviewed·Nov 28, 2022
- d-PBWT: dynamic positional Burrows-Wheeler transform
Ahsan Sanaullah, Degui Zhi, Shaojie Zhang·BioinformaticsPeer-reviewed·Feb 23, 2021
- Compressed Data Structures for Population-Scale Positional Burrows-Wheeler Transforms
Paola Bonizzoni, Christina A. Boucher, … Massimiliano Rossi·bioRxiv·Sep 16, 2022
- μ-PBWT: Enabling the Storage and Use of UK Biobank Data on a Commodity Laptop
Davide Cozzi, Massimiliano Rossi, … Paola Bonizzoni·bioRxiv·Feb 15, 2023
- Dynamic μ-PBWT: Dynamic Run-length Compressed PBWT for Biobank Scale Data
Pramesh Shakya, Ahsan Sanaullah, … Shaojie Zhang·bioRxiv·Feb 4, 2025
- Haplotype-based Parallel PBWT for Biobank Scale Data
Kecong Tang, Ahsan Sanaullah, … Shaojie Zhang·Lecture notes in computer sciencePeer-reviewed·Oct 31, 2025