Title :
A parthenogenetic algorithm for haplotyping a single individual based on WMLF model
Author_Institution :
Coll. of Comput. Sci. & Inf. Technol., Guangxi Normal Univ., Guilin, China
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.
Keywords :
cellular biophysics; computational complexity; genetic algorithms; genetics; NP-hardness; WMLF model-based single individual; computational biology; haplotyping; heuristic algorithm PGA-WMLF; parthenogenetic algorithm; recombination operator; short chromosome code; weighted minimum letter flips model; Algorithm design and analysis; Biological cells; Biological system modeling; Clustering algorithms; Computational modeling; Electronics packaging; Heuristic algorithms;
Conference_Titel :
Natural Computation (ICNC), 2012 Eighth International Conference on
Conference_Location :
Chongqing
Print_ISBN :
978-1-4577-2130-4
DOI :
10.1109/ICNC.2012.6234676