Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

The Complexity of the Single Individual SNP Haplotyping Problem

Abstract

We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype fragments. We consider the complexity of the problems Minimum Error Correction (MEC) and Longest Haplotype Reconstruction (LHR) for different restrictions on the input data. Specifically, we look at the gapless case, where every row of the input corresponds to a gapless haplotype-fragment, and the 1-gap case, where at most one gap per fragment is allowed. We prove that MEC is APX-hard in the 1-gap case and still NP-hard in the gapless case. In addition, we question earlier claims that MEC is NP-hard even when the input matrix is restricted to being completely binary. Concerning LHR, we show that this problem is NP-hard and APX-hard in the 1-gap case (and thus also in the general case), but is polynomial time solvable in the gapless case.

This is a preview of subscription content, log in to check access.

Author information

Correspondence to Rudi Cilibrasi or Leo van Iersel or Steven Kelk or John Tromp.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Cilibrasi, R., van Iersel, L., Kelk, S. et al. The Complexity of the Single Individual SNP Haplotyping Problem. Algorithmica 49, 13–36 (2007). https://doi.org/10.1007/s00453-007-0029-z

Download citation

Keywords

  • Polynomial Time
  • Bipartite Graph
  • Vertex Cover
  • Input Matrix
  • Directed Circuit