计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (10): 46-48.
• 研究、探讨 • 上一篇 下一篇
肖进杰，谢青松，刘培强，范 辉
收稿日期:
修回日期:
出版日期:
发布日期:
XIAO Jinjie，XIE Qingsong，LIU Peiqiang，FAN Hui
Received:
Revised:
Online:
Published:
摘要： 用短块移动操作对一个排列进行排序是一种染色体基因重排技术。怎样才能找出使用短块移动次数最少的排序算法是计算生物学等领域最热门的研究问题之一。给出了短块移动的最优解算法，对近似算法进行了修改。实验验证了最优解算法和近似算法在实际运行过程中都有较好的表现。
关键词: 排序, 短块移动, 计算生物学, 复杂性
Abstract: Sorting a permutation by short block-moves is a kind of technology for genome rearrangement.Sorting permutations with the fewest numbers of short block-move operations （i.e.minimum sorting） has became one of the most interesting problems in the area of computational biology.This paper first gives an optimal algorithm for short block-moves，then modifies the approximate algorithms，by testing data it shows that the two algorithms perform well in practice.
Key words: sort, short block-moves, computational biology, complexity
肖进杰，谢青松，刘培强，范 辉. 短块移动排序算法研究[J]. 计算机工程与应用, 2011, 47(10): 46-48.
XIAO Jinjie，XIE Qingsong，LIU Peiqiang，FAN Hui. Algorithms for sorting by short block-moves[J]. Computer Engineering and Applications, 2011, 47(10): 46-48.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I10/46
