A parthenogenetic algorithm for haplotyping a single individual based on WMLF model

Abstract

In recent years, the problem of haplotyping a single individual has become one of the hottest areas of Computational Biology. The weighted minimum letter flips (WMLF) model is one of the important computational models for this problem. Due to the NP-hardness of the model, in this paper, a practical heuristic algorithm PGA-WMLF based on parthenogenetic algorithm (PGA) is presented to solve it. A kind of short chromosome code and an effective recombination operator are designed for the algorithm. Experiment results indicate that the algorithm is a good solution for WMLF model, and gets better performance than previous works.