期刊文献+

一个SNP问题的多项式时间算法

A polynomial algorithm for a SNP problem
下载PDF
导出
摘要 讨论关于单体型的无间隙的最小单核苷酸多态性位点的移去问题.通过分析其对应图模型的性质讨论问题等价形式;证明求解该问题等价于求对应图的最大独立集与独立数;给出求最大独立集与独立数的算法,从而得到此问题的有效的多项式时间算法. The problem of minimum single nucleotide polymorphisms removal (MSR) on haplotyping was considered. The equivalent form of the problem was discussed by analyzing the properties of its mathematics model. It was proved that the problem of gapless case's MSR is equivalent to compute the maximum independent set and independence number of its graph. The algorithm for computing the maximum independent set and independence number was given; therefore an effective polynomial algorithm for the gapless case's minimum SNPs removal problem was given, which was easy to execute and would give a practical solution.
作者 王骁力
出处 《南阳师范学院学报》 CAS 2007年第3期1-4,共4页 Journal of Nanyang Normal University
关键词 单核苷酸多态性 单体型化 最小单核苷酸多态性位点的移去问题 多项式时间算法 single nucleotide polymorphisms (SNP) hyplotype minimum SNPs removal problem polynomial algorithm.
  • 相关文献

参考文献5

  • 1Venter J, Adams M, Myers E, et al. The sequence of the human genome [ J ]. Science, 2001,291:1304- 1351. 被引量:1
  • 2Daly M. High-resolution haplotype structure in the human genome[J], Nature Genetics, 2001,29(2) :229 -232. 被引量:1
  • 3Lancia G, Bafna V, Istrail S. SNPs problems, complexity and algorithms[A]. Proc of Ann Euro Symp on Algorithms (ESA),Lecture Notes in Computer Science,Denmark, Springer-Verlag 2001, 2161 : 182 - 193. 被引量:1
  • 4Hayward R. Weakly triangulated graphs [ J ]. J Comb Th (B) 1985,39:200-209, 被引量:1
  • 5Groetschel M, Lovasz L and Schrijver A. A polynomial algorithm for perfect graphs[ J]. Annals of Discr Math 1984, 21:325 -356. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部