期刊文献+

基于第一降序小队翻转排序算法

An Approximate Algorithm Of Sorting Reversal Based On First Descending Strip
下载PDF
导出
摘要 计算不同基因序列的演化距离问题可以转换为寻找两个排列间的翻转距离问题,对于大部分实例来说,最小排序翻转序列是存在的。在探索基因重排空间问题上,获取最小翻转距离非常有意义。引入了两个引理并证明了引理,然后描述了FDSR算法,最后分析了算法的效率并得出了结论。 The problem of estimation evolutionary distance from differences in gene order has been distilled to the problem of finding the reversal distance between two signed permutations.For most problem instances,many minimum sequences of sorting reversals exist,and it is very important to explore the space of genome rearrangements.In this paper,we begin by introducing two lemmas and proving them;then we describe the approximate algorithm named FDSR;finally,we analyze the algorithm and form a conclusion.
作者 刘声田 王娟
出处 《山东电大学报》 2006年第4期68-69,共2页 Journal of Shandong TV University
关键词 基因组重排 翻转排序 genome rearrangement,sorting by reversals
  • 相关文献

参考文献5

  • 1[1]Bafna,V.and Pevzner,Genome rearrangements and sorting by reversals,P.SIAM Journal of Computing,1996,25 (2):272-289.
  • 2[2]Adam C.Siepel.An Algorithm To Find All Sorting Reversals.http://www.cse.ucsc.edu/ ~ acs/asr.pdf
  • 3[3]Caprara A.Sorting by Reversals is Difficult[A].Proceedings of the First Annual International Conference on Computational Molecular Biology[C].New York,ACM Press,1997:75-83.
  • 4[4]Hannenhalli S,Pevzner P.Transforming Cabbage into Turnip[J].Journal of the ACM,1999,46(1):1 -27
  • 5[5]陈明江.Sorting by Transpositions Based on the First Increasing Substring Concept.http://163.22.21.49/or/MCChen2004.pdf.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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