Genetic Master-Slave Algorithm for Haplotype Inference by Parsimony

Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotypes. This piece of information makes it possible to perform association studies for the genetic variants involved in multifactorial diseases and the individual responses to therapeutic agents. A notable approach to the problem is to encode it as a combinatorial problem (under certain hypotheses, such as the pure parsimony criterion) and to solve it using combinatorial optimization techniques. Recently, several new approaches to the problem were presented. Among them, solvers based on hybrid metaheuristics have been proven to be effective in solving large size instances. In this paper, we present an master-slave hybrid approach, in which a master solver optimize the parameters used by a slave solver for constructing a solution. By testing the algorithm on common Haplotype Inference benchmarks, we show that this approach can produce good quality solutions in a very short execution time.

[1]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[2]  Andrea Roli,et al.  Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony , 2008, J. Algorithms.

[3]  P. Tam.  The International HapMap Consortium. The International HapMap Project (Co-PI of Hong Kong Centre which responsible for 2.5% of genome) , 2003 .

[4]  Thomas Stützle,et al.  Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem , 2008, INFORMS J. Comput..

[5]  Xiang-Sun Zhang,et al.  Haplotype Inference by Pure Parsimony via Genetic Algorithm , 1997 .

[6]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[7]  Inês Lynce,et al.  Efficient Haplotype Inference with Boolean Satisfiability , 2006, AAAI.

[8]  Inês Lynce,et al.  Efficient Haplotype Inference with Pseudo-boolean Optimization , 2007, AB.

[9]  Giuseppe Lancia,et al.  Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms , 2004, INFORMS J. Comput..

[10]  Dan Gusfield,et al.  Haplotype Inference by Pure Parsimony , 2003, CPM.

[11]  Luca Di Gaspero,et al.  EASYLOCAL++: an object‐oriented framework for the flexible design of local‐search algorithms , 2003, Softw. Pract. Exp..

[12]  Andrea Roli,et al.  Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[13]  Daniel G. Brown,et al.  Integer programming approaches to haplotype inference by pure parsimony , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[14]  Ting Chen,et al.  An approximation algorithm for haplotype inference by maximum parsimony , 2005, SAC '05.

[15]  M. Olivier.  A haplotype map of the human genome. , 2003, Nature.

[16]  Konstantinos Kalpakis,et al.  Haplotype phasing using semidefinite programming , 2005, Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05).

[17]  Shibu Yooseph,et al.  A Survey of Computational Methods for Determining Haplotypes , 2002, Computational Methods for SNPs and Haplotype Inference.

[18]  Christian Blum,et al.  Hybrid Metaheuristics, An Emerging Approach to Optimization , 2008, Hybrid Metaheuristics.

[19]  John N. Hooker,et al.  Integrated methods for optimization , 2011, International series in operations research and management science.

[20]  Inês Lynce,et al.  SAT in Bioinformatics: Making the Case with Haplotype Inference , 2006, SAT.

[21]  Andrea Roli,et al.  Two-Level ACO for Haplotype Inference Under Pure Parsimony , 2008, ANTS Conference.

[22]  A. Clark,et al.  Inference of haplotypes from PCR-amplified samples of diploid populations. , 1990, Molecular biology and evolution.