Encyclopedia of Algorithms

2008 Edition
| Editors: Ming-Yang Kao

Perfect Phylogeny Haplotyping

2005; Ding, Filkov, Gusfield
  • Giuseppe Lancia
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30162-4_289

Keywords and Synonyms

Alleles phasing        

Problem Definition

In the context of the perfect phylogeny haplotyping (PPH) problem, each vector \( { h\in \{0,1\}^m } \)


Class Root Coalescent Model Perfect Phylogeny Free Link Common Ancestral Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Bafna, V., Gusfield, D., Lancia, G., Yooseph, S.: Haplotyping as perfect phylogeny: a direct approach. J. Comput. Biol. 10(3–4), 323–340 (2003)CrossRefGoogle Scholar
  2. 2.
    Bixby, R.E., Wagner, D.K.: An almost linear-time algorithm for graph realization. Math. Oper. Res. 13, 99–123 (1988)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Bonizzoni, P., Della Vedova, G., Dondi, R., Li, J.: The haplotyping problem: an overview of computational models and solutions. J. Comput. Sci. Technol. 19(1), 1–23 (2004)CrossRefGoogle Scholar
  4. 4.
    Chung, R.H., Gusfield, D.: Empirical exploration of perfect phylogeny haplotyping and haplotypes. In: Proceedings of Annual International Conference on Computing and Combinatorics (COCOON). Lecture Notes in Computer Science, vol. 2697, pp. 5–9. Springer, Berlin (2003)Google Scholar
  5. 5.
    Ding, Z., Filkov, V., Gusfield, D.: A linear-time algorithm for the perfect phylogeny haplotyping problem. In: Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB), New York, 2005. ACM Press, New York (2005)Google Scholar
  6. 6.
    Eskin, E., Halperin, E., Karp, R.: Efficient reconstruction of haplotype structure via perfect phylogeny. J. Bioinform. Comput. Biol. 1(1), 1–20 (2003)CrossRefGoogle Scholar
  7. 7.
    Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Myers, G., Hannenhalli, S., Istrail, S., Pevzner, P., Waterman, M. (eds.) Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB), New York, 2002, pp. 166–175. ACM Press (2002)Google Scholar
  8. 8.
    Gusfield, D. Orzack, S.H.: Haplotype inference. In: Aluru S. (ed) Handbook of Computational Molecular Biology, pp. 1–28. Champman and Hall/CRC-press, Boca Raton (2005)Google Scholar
  9. 9.
    Helmuth, L.: Genome research: Map of the human genome 3.0. Science 293(5530), 583–585 (2001)CrossRefGoogle Scholar
  10. 10.
    Halldorsson, B.V., Bafna, V., Edwards, N., Lippert, R., Yooseph, S., Istrail, S.: A survey of computational methods for determining haplotypes. In: Computational methods for SNP and haplotype inference: DIMACS/RECOMB satellite workshop. Lecture Notes in Computer Science, vol. 2983, pp. 26–47. Springer, Berlin (2004)Google Scholar
  11. 11.
    Hudson, R.: Gene genealogies and the coalescent process. Oxf. Surv. Evol. Biol. 7, 1–44 (1990)Google Scholar
  12. 12.
    Hudson, R.: Generating samples under the wright-fisher neutral model of genetic variation. Bioinformatics 18(2), 337–338 (2002)CrossRefGoogle Scholar
  13. 13.
    Lancia, G.: The phasing of heterozygous traits: Algorithms and complexity. Comput. Math. Appl. 55(5), 960–969 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Wiuf, C.: Inference on recombination and block structure using unphased data. Genetics 166(1), 537–545 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Giuseppe Lancia
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of UdineUdineItaly