Abstract
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.
Similar content being viewed by others
References
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.
NIH. Report on variation and the haplotype map. http://www.nhgri.nih.gov/About_NHGRI/Der/variat.htm.
Gabriel S Bet al. The structure of haplotype blocks in the human genome.Science, 2002, 296(5576): 2225–2229.
Patil Net al. Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21.Science, 2001, 294(5547): 1719–1723.
Clark A. Inference of haplotypes from PCR-amplied samples of diploid populations.Molecular Biology and Evolution, 1990, 7(2): 111–122.
Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms.Journal of Computational Biology, 2001, 8(3): 305–323.
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.
Gusfield D. Haplotype inference by pure parsimony.Lecture Notes in Computer Science 2676, 2003, pp.144–155.
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Note
This work is supported by the Chinese Academy of Sciences under Grant No. KSCX2-2-27, the National Natural Science Foundation of China under Grant No. 39890070 and 60414000, the National High Technology Development 863 Program of China under Grant No. 2002AA231031, the National Grand Fundamental Research 973 Program of China under Grant Nos. 2002CB713805, 2003CB715900 and Beijing Science and Technology Commission under Grant No. H010210010113.
Rights and permissions
About this article
Cite this article
Lin, H., Zhang, ZF., Zhang, QF. et al. A note on the single genotype resolution problem. J. Comput. Sci. & Technol. 19, 254–257 (2004). https://doi.org/10.1007/BF02944804
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02944804