FNphasing: a novel fast heuristic algorithm for haplotype phasing based on flow network model.
An enormous amount of sequence data has been generated with the development of new DNA sequencing technologies, which presents great challenges for computational biology problems such as haplotype phasing. Although arduous efforts have been made to address this problem, the current methods still cannot efficiently deal with the incoming flood of large-scale data. In this paper, we propose a flow network model to tackle haplotype phasing problem, and explain some classical haplotype phasing rules based on this model. By incorporating the heuristic knowledge obtained from these classical rules, we design an algorithm FNphasing based on the flow network model. Theoretically, the time complexity of our algorithm is (O(n(2)m+m(2)), which is better than that of 2SNP, one of the most efficient algorithms currently. After testing the performance of FNphasing with several simulated data sets, the experimental results show that when applied on large-scale data sets, our algorithm is significantly faster than the state-of-the-art Beagle algorithm. FNphasing also achieves an equal or superior accuracy compared with other approaches.
University of Science and Technology of China, Hefei, Anhui 230027, China. jiaoyun@mail.ustc.edu.cn
Jiaoyun
J
Yang
Yun
Y
Xu
Xiaohui
X
Yao
Guoliang
G
Chen
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D005838:Genotype; D060148:HapMap Project; D006239:Haplotypes / Q000235:genetics*; D006801:Humans; D008957:Models, Genetic; D007703:Peptidyl-Dipeptidase A / Q000235:genetics; D020641:Polymorphism, Single Nucleotide; D011995:Recombination, Genetic; D017422:Sequence Analysis, DNA
D007703:Peptidyl-Dipeptidase A