Advertisement

Journal of Computer Science and Technology

, Volume 19, Issue 2, pp 254–257 | Cite as

A note on the single genotype resolution problem

  • Hao LinEmail author
  • Ze-Feng Zhang
  • Qiang-Feng Zhang
  • Dong-Bo Bu
  • Ming Li
Article

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.

Keywords

haplotype inference single genotype resolution maximum resolution NP-completeness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    NIH. Report on variation and the haplotype map. http://www.nhgri.nih.gov/About_NHGRI/Der/variat.htm.Google Scholar
  3. [3]
    Gabriel S Bet al. The structure of haplotype blocks in the human genome.Science, 2002, 296(5576): 2225–2229.CrossRefGoogle Scholar
  4. [4]
    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
  5. [5]
    Clark A. Inference of haplotypes from PCR-amplied samples of diploid populations.Molecular Biology and Evolution, 1990, 7(2): 111–122.Google Scholar
  6. [6]
    Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms.Journal of Computational Biology, 2001, 8(3): 305–323.CrossRefGoogle Scholar
  7. [7]
    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
  8. [8]
    Gusfield D. Haplotype inference by pure parsimony.Lecture Notes in Computer Science 2676, 2003, pp.144–155.CrossRefMathSciNetGoogle Scholar
  9. [9]
    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

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2004

Authors and Affiliations

  • Hao Lin
    • 1
    Email author
  • Ze-Feng Zhang
    • 1
  • Qiang-Feng Zhang
    • 2
  • Dong-Bo Bu
    • 1
  • Ming Li
    • 3
    • 4
  1. 1.Bioinformatics Lab, Institute of Computing TechnologyThe Chinese Academy of SciencesBeijingP.R. China
  2. 2.University of Science and Technology of ChinaHefeiP.R. China
  3. 3.University of WaterlooCanada
  4. 4.Tsinghua UniversityBeijingP.R. China

Personalised recommendations