摘要
用短块移动操作对一个排列进行排序是一种染色体基因重排技术。怎样才能找出使用短块移动次数最少的排序算法是计算生物学等领域最热门的研究问题之一。给出了短块移动的最优解算法,对近似算法进行了修改。实验验证了最优解算法和近似算法在实际运行过程中都有较好的表现。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第10期46-48,53,共4页
Computer Engineering and Applications
关键词
排序
短块移动
计算生物学
复杂性
sort
short block-moves
computational biology
complexity
