A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments
by Jingli Wu; Jianxin Wang; Jian'er Chen
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 9, No. 1, 2013

Abstract: 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.

Online publication date: Sat, 06-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com