On the Complexity of the Single Individual SNP Haplotyping Problem

@inproceedings{Cilibrasi2006OnTC,
  title={On the Complexity of the Single Individual SNP Haplotyping Problem},
  author={Rudi Cilibrasi and Leo van Iersel and Steven Kelk and John Tromp},
  year={2006}
}
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 1gap case… CONTINUE READING