Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
Proceedings of the sixth annual international conference on Computational biology
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
SNPs Problems, Complexity, and Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Opportunities for Combinatorial Optimization in Computational Biology
INFORMS Journal on Computing
Polynomial and APX-hard cases of the individual haplotyping problem
Theoretical Computer Science - Pattern discovery in the post genome
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Haplotype assembly from aligned weighted SNP fragments
Computational Biology and Chemistry
Hi-index | 0.00 |
Haplotyping problem has been the subject of extensive research in recent years, and is one of the hottest areas of Computational Biology today. In this paper, we study the single individual Single Nucleotide Polymorphism (SNP) haplotype reconstruction problem. A heuristic algorithm is proposed for assembling a pair of haplotypes from a set of aligned weighted SNP fragments. Computational experiments indicate that the algorithm is a good solution for the Weighted Minimum Letter Flips (WMLF) model, and gets better performance than previous works.