Sciweavers

Share
CONSTRAINTS
2008

Boosting Haplotype Inference with Local Search

8 years 11 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response to drugs. One of the approaches to haplotype inference aims to minimise the number of different haplotypes used, and is known as haplotype inference by pure parsimony (HIPP). The HIPP problem is computationally difficult, being NP-hard. Recently, a SAT-based method (SHIPs) has been proposed to solve the HIPP problem. This method iteratively considers an increasing number of haplotypes, starting from an initial lower bound. Hence, one important aspect of SHIPs is the lower bounding procedure, which reduces the number of iterations of the basic algorithm, and also indirectly simplifies the resulting SAT model. This paper describes the use of local search to improve existing lower bounding procedures. The new lower bounding procedure is guaranteed to be as tight as the existing procedures. In practice the new p...
Inês Lynce, João Marques-Silva, Steve
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CONSTRAINTS
Authors Inês Lynce, João Marques-Silva, Steven David Prestwich
Comments (0)
books