Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable

  • Jens Gramm
  • Till Nierhoff
  • Till Tantau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3162)

Abstract

Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and error-free input instances—these instances can be organized as a genotype matrix whose rows are the genotypes and whose columns are the single nucleotide polymorphisms under consideration. Unfortunately, in the more realistic setting of missing entries in the genotype matrix, even restricted forms of the perfect phylogeny haplotyping problem become NP-hard. We show that haplotyping via perfect phylogeny with missing data becomes computationally tractable when imposing additional biologically motivated constraints. Firstly, we focus on asking for perfect phylogenies that are paths, which is motivated by the discovery that yin-yang haplotypes span large parts of the human genome. A yin-yang haplotype implies that every corresponding perfect phylogeny has to be a path. Secondly, we assume that the number of missing entries in every column of the input genotype matrix is bounded. We show that the perfect path phylogeny haplotyping problem is fixed-parameter tractable when we consider the maximum number of missing entries per column of the genotype matrix as parameter. The restrictions we impose are met by a majority of the problem instances encountered in publicly available human genome data.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bafna, V., Gusfield, D., Lancia, G., Yooseph, S.: Haplotyping as perfect phylogeny: A direct approach. Journal of Computational Biology 10(3–4), 323–340 (2003)CrossRefGoogle Scholar
  2. 2.
    Eskin, E., Halperin, E., Karp, R.M.: Efficient reconstruction of haplotype structure via perfect phylogeny. Journal of Bioinformatics and Computational Biology 1(1), 1–20 (2003)CrossRefGoogle Scholar
  3. 3.
    Gabriel, S.B., Schaffner, S.F., Nguyen, H., Moore, J.M., Roy, J., Blumenstiel, B., Higgins, J., DeFelice, M., Lochner, A., Faggart, M., Liu-Cordero, S.N., Rotimi, C., Adeyemo, A., Cooper, R., Ward, R., Lander, E.S., Daly, M.J., Altshuler, D.: Structure of halpotype blocks in the human genome. Science 296, 2225–2229 (2002)CrossRefGoogle Scholar
  4. 4.
    Golumbic, M.C., Wassermann, A.: Complexity and algorithms for graph and hypergraph sandwich problems. Graphs and Combinatorics 14, 223–229 (1998)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gramm, J., Nierhoff, T., Sharan, R., Tantau, T.: On the complexity of haplotyping via perfect phylogeny. In: Proceedings of the 2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. LNCS (LNBI), Springer, Heidelberg (2004) (to appear)Google Scholar
  6. 6.
    Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Proceedings of the 6th RECOMB, pp. 166–175. ACM Press, New York (2002)Google Scholar
  7. 7.
    Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype assignment. In: Proceedings of the 8th RECOMB, pp. 10–19. ACM Press, New York (2004)Google Scholar
  8. 8.
    Kimmel, G., Shamir, R.: The incomplete perfect phylogeny haplotype problem. In: Proceedings of the 2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. LNCS (LNBI), Springer, Heidelberg (2004) (to appear)Google Scholar
  9. 9.
    Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. The Johns Hopkins University Press, Baltimore (1992)Google Scholar
  10. 10.
    Zhang, J., Rowe, W.L., Clark, A.G., Buetow, K.H.: Genomewide distribution of highfrequency, completely mismatching SNP haplotype pairs observed to be common across human populations. American Journal of Human Genetics 73(5), 1073–1081 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jens Gramm
    • 1
  • Till Nierhoff
    • 1
  • Till Tantau
    • 1
  1. 1.International Computer Science InstituteBerkeleyUSA

Personalised recommendations