Parameterised algorithms of the individual haplotyping problem with gaps
by Minzhu Xie; Jing Wang
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 9, No. 1, 2013

Abstract: The individual haplotyping problem is the computational problem of constructing two haplotypes from one's DNA fragments. We proposed parameterised algorithms for computational models Minimum SNP Removal (MSR) and Minimum Fragment Removal (MFR) of the problem. For m DNA fragments and n SNPs, our algorithms solve MSR and MFR in O(2^knk₁k₂+mlogm+nk₂+mk₁) and O(mk₁k₂2^k+2^3kmk₂²+mlogm+nk₂+mk₁) time respectively, where k₁ is the maximum fragment length, k₂ is the maximum number of fragments covering a SNP site and k is the maximum number of holes in a fragment. Since k₁ and k₂ are both small in practice, our algorithms are efficient and applicable.

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