This note settles the complexity of the single genotype resolution problem showing it is NP-complete. This solves an open problem raised by P. Bonizzoni, G.D. Vedova, R. Dondi, and J. Li. The same proof also gives an alternative and simpler reduction of the NP-hardness of Maximum Resolution problem.
haplotype inference single genotype resolution maximum resolution NP-completeness
This is a preview of subscription content, log in to check access.
Bonizzoni P, Vedova G D, Dondi R, Li J. The haplotyping problem: An overview of computational models and solutions.Journal of Computer Science and Technology, 2003, 18(6): 675–688.zbMATHCrossRefMathSciNetGoogle Scholar
NIH. Report on variation and the haplotype map. http://www.nhgri.nih.gov/About_NHGRI/Der/variat.htm.Google Scholar
Gabriel S Bet al. The structure of haplotype blocks in the human genome.Science, 2002, 296(5576): 2225–2229.CrossRefGoogle Scholar
Patil Net al. Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21.Science, 2001, 294(5547): 1719–1723.CrossRefGoogle Scholar
Clark A. Inference of haplotypes from PCR-amplied samples of diploid populations.Molecular Biology and Evolution, 1990, 7(2): 111–122.Google Scholar
Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms.Journal of Computational Biology, 2001, 8(3): 305–323.CrossRefGoogle Scholar
Li J, Jiang T. Efficient rule-based haplotyping algorithms for pedigree data. InProc. 7th Annual Conference on Research in Computational Molecular Biology (RECOMB), 2003, pp.197–206.Google Scholar
Halperin E, Eskin E, Karp R M. Large scale reconstruction of haplotypes from genotype data. InProc. 7th Annual Conference on Research in Computational Molecular Biology (RECOMB), 2003, pp.104–113.Google Scholar