Phylogeny- and Parsimony-Based Haplotype Inference with Constraints
Haplotyping, also known as haplotype phase prediction, is the problem of predicting likely haplotypes based on genotype data. One fast computational haplotyping method is based on an evolutionary model where a perfect phylogenetic tree is sought that explains the observed data. In their cpm 2009 paper, Fellows et al. studied an extension of this approach that incorporates prior knowledge in the form of a set of candidate haplotypes from which the right haplotypes must be chosen. While this approach may help to increase the accuracy of haplotyping methods, it was conjectured that the resulting formal problem constrained perfect phylogeny haplotyping might be NP-complete. In the present paper we present a polynomial-time algorithm for it. Our algorithmic ideas also yield new fixed-parameter algorithms for related haplotyping problems based on the maximum parsimony assumption.
KeywordsMaximum Parsimony Recursive Call Distinct Haplotype Phase Constraint Haplotype Inference
Unable to display preview. Download preview PDF.
- 6.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)Google Scholar
- 7.Elberfeld, M.: Perfect phylogeny haplotyping is complete for logspace. Computing Research Repository (CoRR), abs/0905.0602 (2009)Google Scholar
- 9.Elberfeld, M., Tantau, T.: Phylogeny- and parsimony-based haplotype inference with constraints. Technical Report SIIM-TR-A-10-01, Universität zu Lübeck (2010)Google Scholar
- 11.Excoffier, L., Slatkin, M.: Maximum-likelihood estimation of molecular haplotype frequencies in a diploid population. Mol. Biol. and Evol. 12(5), 921–927 (1995)Google Scholar
- 18.Liu, Y., Zhang, C.-Q.: A linear solution for haplotype perfect phylogeny problem. In: Proc. Int. Conf. Adv. in Bioinf. and Appl., pp. 173–184. World Scientific, Singapore (2005)Google Scholar