ACOHAP: an efficient ant colony optimization for the haplotype inference by pure parsimony problem

作者：Dong Duc Do; Sy Vinh Le^*; Xuan Huan Hoang

来源：Swarm Intelligence, 2013, 7(1): 63-77.

DOI：10.1007/s11721-013-0077-8

• ACOHAP
• Ant colony optimization
• Haplotype inference
• Pure parsimony
• Genotypes

Haplotype information plays an important role in many genetic analyses. However, the identification of haplotypes based on sequencing methods is both expensive and time consuming. Current sequencing methods are only efficient to determine conflated data of haplotypes, that is, genotypes. This raises the need to develop computational methods to infer haplotypes from genotypes.
Haplotype inference by pure parsimony is an NP-hard problem and still remains a challenging task in bioinformatics. In this paper, we propose an efficient ant colony optimization (ACO) heuristic method, named ACOHAP, to solve the problem. The main idea is based on the construction of a binary tree structure through which ants can travel and resolve conflated data of all haplotypes from site to site. Experiments with both small and large data sets show that ACOHAP outperforms other state-of-the-art heuristic methods. ACOHAP is as good as the currently best exact method, RPoly, on small data sets. However, it is much better than RPoly on large data sets. These results demonstrate the efficiency of the ACOHAP algorithm to solve the haplotype inference by pure parsimony problem for both small and large data sets.

• 出版日期2013-3