有Mate-Pairs的个体单体型MSR问题的参数化算法.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.18, No.9, September 2007, pp .2070−2082 http://www.j DOI: 10. 1360/jos1 82070 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 有Mate-Pairs 的个体单体型MSR 问题的参数化算法 1,2 1 1+ 谢民主 , 陈建二, 王建新 1( 中南大学 信息科学与工程学院,湖南 长沙 410083) 2 (湖南师范大学 物理与信息科学学院,湖南 长沙 410081) Parameterized Algorithm of the Individual Haplotyping MSR Problem with Mate-Pairs 1,2 1 1+ XIE Min-Zhu , CHEN Jian-Er , WANG Jian-Xin 1(School of Information Science and Engineering, Central South University, Changsha 410083, China) 2 (College of Physics and Information Science, Hu ’nan Normal University, Changsha 410081, China) + Corresponding author: Phn: +86-731-8830212, E-mail: jxwang@ Xie MZ, Chen JE, Wang JX. Parameterized algorithm of the individual haplotyping MSR problem with Mate-Pairs. Journal of Software, 2007,18(9):2070−2082. /1000-9825/18/2070.htm Abstract: The individual haplotyping MSR (minimum SNP removal) problem is the computational problem of inducing an individual’s haplotypes from one’s DNA fragments sequencing data by dropping minimum SNPs (single-nucleotide polymorphisms). To solve the problem, Bafna, et al. had provided an algorithm of time k 2 complexity O(2 n m) with the number of fragments m, the SNP sites n, the maximum number of holes k in a fragment. In the case that there are som