The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is important in practical fields such as the investigation of diseases or other types of genetic mutations. In order to find the haplotypes which are as close as possible to the real set of haplotypes that comprise the genotypes, two models have been suggested which are by now well-studied: The perfect phylogeny model and the pure parsimony model. All known algorithms up till now for haplotype inference may find haplotypes that are not necessarily plausible, i.e., very rare haplotypes or haplotypes that were never observed in the population. In order to overcome this disadvantage, we study in this paper, a new constrained version of HIP under the above-mentioned models. In this new version, a pool of plausible haplotypes H? is given together with the set of genotypes G, and the goal is to find a subset H H? that resolves G. For constrained perfect phylogeny haplotyping (CPPH), we provide initial insights and polynomial-time algorithms for some restricted cases of the problem. For constrained parsimony haplotyping (CPH), we show that the problem is fixed parameter tractable when parameterized by the size of the solution set of haplotypes. � 2011 IEEE.
|Number of pages||8|
|Journal||IEEE/ACM Transactions on Computational Biology and Bioinformatics|
|Publication status||Published - 2011|
Fellows, M., Hartman, T., Hermelin, D., Landau, G., Rosamond, F., & Rozenberg, L. (2011). Haplotype inference constrained by plausible haplotype data. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(6), 1692-1699. https://doi.org/10.1109/TCBB.2010.72