Genome ResearchBioinformaticsPeer-reviewed journal article
Minimal Positional Substring Cover: A Haplotype Threading Alternative to Li & Stephens Model
Abstract
The Li & Stephens (LS) hidden Markov model (HMM) models the process of reconstructing a haplotype as a mosaic copy of haplotypes in a reference panel (haplotype threading). For small panels the probabilistic parameterization of LS enables modeling the uncertainties of such mosaics, and has been the foundational model for haplotype phasing and imputation. However, LS becomes inefficient when sample size is large (tens of thousands to millions), because of its linear time complexity (O(MN), where M is the number of haplotypes and N is the number of sites in the panel). Recently the PBWT, an efficient data structure capturing the local haplotype matching among haplotypes, was proposed to offer fast methods for giving some optimal solution (Viterbi) to the LS HMM. But the solution space of the LS for large panels is still elusive. Previously we introduced the Minimal Positional Substring Cover (MPSC) problem as an alternative formulation of LS whose objective is to cover a query haplotype by a minimum number of segments from haplotypes in a reference panel. The MPSC formulation allows the generation of a haplotype threading in time constant to sample size (O(N)). This allows haplotype threading on very large biobank scale panels on which the LS model is infeasible. Here we present new results on the solution space of the MPSC by first identifying a property that any MPSC will have a set of required regions, and then proposing a MPSC graph. In addition, we derived a number of optimal algorithms for MPSC, including solution enumerations, the Length Maximal MPSC, and h-MPSC solutions. In doing so, our algorithms reveal the solution space of LS for large panels. Even though we only solved an extreme case of LS where the emission probability is 0, our algorithms can be made more robust by PBWT smoothing. We show that our method is informative in terms of revealing the characteristics of biobank-scale data sets and can improve genotype imputation.
- Citations
- 3
Reproducibility 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
- An average-case sublinear exact Li and Stephens forward algorithm
Yohei Rosen, Benedict Paten·Algorithms for Molecular BiologyPeer-reviewed·Apr 2, 2019
- Fast haplotype matching in very large cohorts using the Li and Stephens model
Gerton Lunter·bioRxiv·Apr 12, 2016
- The solution path of the Li-Stephens haplotype copying model
Yifan Jin, Jonathan Terhorst·bioRxiv·Aug 3, 2022
- Evaluation of Vicinity-based Hidden Markov Models for Genotype Imputation
Su Wang, Miran Kim, … Arif O. Harmanci·BMC BioinformaticsPeer-reviewed·Aug 29, 2022
- Genotype imputation using the Positional Burrows Wheeler Transform
Simone Rubinacci, Olivier Delaneau, Jonathan Marchini·PLoS GeneticsPeer-reviewed·Nov 16, 2020
- Haplotype-based Parallel PBWT for Biobank Scale Data
Kecong Tang, Ahsan Sanaullah, … Shaojie Zhang·Lecture notes in computer sciencePeer-reviewed·Oct 31, 2025