Skip to main content
Log in

A note on the single genotype resolution problem

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

W. B. Langdon

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  2. NIH. Report on variation and the haplotype map. http://www.nhgri.nih.gov/About_NHGRI/Der/variat.htm.

  3. Gabriel S Bet al. The structure of haplotype blocks in the human genome.Science, 2002, 296(5576): 2225–2229.

    Article  Google Scholar 

  4. Patil Net al. Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21.Science, 2001, 294(5547): 1719–1723.

    Article  Google Scholar 

  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. Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms.Journal of Computational Biology, 2001, 8(3): 305–323.

    Article  Google Scholar 

  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.

  8. Gusfield D. Haplotype inference by pure parsimony.Lecture Notes in Computer Science 2676, 2003, pp.144–155.

    Article  MathSciNet  Google Scholar 

  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.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hao Lin.

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

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944804

Keywords

Navigation