TY - GEN

T1 - Haplotype Inference Constrained by Plausible Haplotype Data

AU - Fellows, Michael R.

AU - Hartman, Tzvika

AU - Hermelin, Dan

AU - Landau, Gad M.

AU - Rosamond, Frances

AU - Rozenberg, Liat

N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.

PY - 2009/11/9

Y1 - 2009/11/9

N2 - The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, such as the investigation of diseases, or other types of genetic mutations. In order to find the haplotypes that are as close as possible to the real set of haplotypes that comprise the genotypes, two models have been suggested which by now have become widely accepted: The perfect phylogeny model and the pure parsimony model. All known algorithms up till now for the above problem 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, for the first time, 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 the constrained perfect phylogeny haplotyping (CPPH) problem we provide initial insights and polynomial-time algorithms for some restricted cases that help understanding the complexity of that problem. We also prove that the constrained parsimony haplotyping (CPH) problem is fixed parameter tractable by providing a parameterized algorithm that applies an interesting dynamic programming technique for solving the problem.

AB - The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, such as the investigation of diseases, or other types of genetic mutations. In order to find the haplotypes that are as close as possible to the real set of haplotypes that comprise the genotypes, two models have been suggested which by now have become widely accepted: The perfect phylogeny model and the pure parsimony model. All known algorithms up till now for the above problem 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, for the first time, 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 the constrained perfect phylogeny haplotyping (CPPH) problem we provide initial insights and polynomial-time algorithms for some restricted cases that help understanding the complexity of that problem. We also prove that the constrained parsimony haplotyping (CPH) problem is fixed parameter tractable by providing a parameterized algorithm that applies an interesting dynamic programming technique for solving the problem.

UR - http://www.scopus.com/inward/record.url?scp=70350686300&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02441-2_30

DO - 10.1007/978-3-642-02441-2_30

M3 - פרסום בספר כנס

AN - SCOPUS:70350686300

SN - 9783642024405

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 339

EP - 352

BT - Combinatorial Pattern Matching

A2 - Kucherov, Gregory

A2 - Ukkonen, Esko

PB - Springer

T2 - 20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009

Y2 - 22 June 2009 through 24 June 2009

ER -