A Faster Haplotyping Algorithm Based on Block Partition, and Greedy Ligation Strategy
Haplotype played a very important role in the study of some disease gene and drug response tests over the past years. However, it is both time consuming and very costly to obtain haplotypes by experimental way. Therefore haplotype inference was proposed which deduce haplotypes from the genotypes through computing methods. Some genetic models were presented to solve the haplotype inference problem, and Maximum Parsimony model was one of them, but at present the methods based on this principle are either simple greedy heuristic or exact ones, which are adequate only for moderate size instances. In this paper, we presented a faster greedy algorithm named FHBPGL applying partition and ligation strategy. Theoretical analysis shows that this strategy can reduce the running time for large scale dataset and following experiments demonstrated that our algorithm gained comparable accuracy compared to exact haplotyping algorithms with less time.
KeywordsMaximum Parsimony Heterozygous Locus Haplotype Inference Block Partition Perfect Phylogeny
Unable to display preview. Download preview PDF.
- 1.International HapMap Consortium: The international HapMap project. Nature 426 789–796 (2003)Google Scholar
- 3.Excoffier, L., Slatkin, M.: Maximum-likelihood estimation of molecular haplotype frequencies in a diploid population. Molecular Biology and Evolution 12(5), 921–927 (1995)Google Scholar
- 7.Clark, A.: Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology and Evolution 7(2), 111–122 (1990)Google Scholar