Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event
- 772 Downloads
The haplotype inference (HI) problem is the problem of inferring 2n haplotype pairs from n observed genotype vectors. This is a key problem that arises in studying genetic variation in populations, for example in the ongoing HapMap project . In order to have a hope of finding the haplotypes that actually generated the observed genotypes, we must use some (implicit or explicit) genetic model of the evolution of the underlying haplotypes. The Perfect Phylogeny Haplotyping (PPH) model was introduced in 2002  to reflect the “neutral coalescent” or “perfect phylogeny” model of haplotype evolution. The PPH problem (which can be solved in polynomial time) is to determine whether there is an HI solution where the inferred haplotypes can be derived on a perfect phylogeny (tree).
Since the introduction of the PPH model, several extensions and modifications of the PPH model have been examined. The most important modification, to model biological reality better, is to allow a limited number of biological events that violate the perfect phylogeny model. This was accomplished implicitly in [7,12] with the inclusion of several heuristics into an algorithm for the PPH problem . Those heuristics are invoked when the genotype data cannot be explained with haplotypes that fit the perfect phylogeny model. In this paper, we address the issue explicitly, by allowing one recombination or homoplasy event in the model of haplotype evolution. We formalize the problems and provide a polynomial time solution for one problem, using an additional, empirically-supported assumption. We present a related framework for the second problem which gives a practical algorithm. We believe the second problem can be solved in polynomial time.
KeywordsPhylogenetic Network Haplotype Inference Ancestral Recombination Graph Coalescent Model Leaf Label
Unable to display preview. Download preview PDF.
- 3.Barzuza, T., Beckman, J.S., Shamir, R., Pe’er, I.: Computational problems in perfect phylogeny haplotyping: XOR genotypes and tag SNPs. In: Proc. of CPM, pp. 14–31 (2004)Google Scholar
- 5.International HapMap Consortium. The HapMap project. Nature 426, 789–796 (2003)Google Scholar
- 7.Eskin, E., Halperin, E., Karp, R.: Large scale reconstruction of haplotypes from genotype data. In: Proc. of RECOMB, pp. 104–113 (2003)Google Scholar
- 9.Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions (Extended Abstract). In: Proc. of RECOMB, pp. 166–175 (2002)Google Scholar
- 14.Hudson, R.: Gene genealogies and the coalescent process. Oxford Survey of Evolutionary Biology 7, 1–44 (1990)Google Scholar
- 21.Tavaré, S.: Calibrating the clock: Using stochastic processes to measure the rate of evolution. In: Lander, E., Waterman, M. (eds.) Calculating the Secrets of Life. National Academy Press, Washington (1995)Google Scholar