...
首页> 外文期刊>Journal of Computers >Improving the Performance of a Genome Sorting Algorithm with Inverted Block-Interchange
【24h】

Improving the Performance of a Genome Sorting Algorithm with Inverted Block-Interchange

机译:用反相块交换提高基因组分选算法的性能

获取原文
           

摘要

—A classic problem in comparative genomics is to find a shortest sequence of evolutionary operations that transform one genome into another. There are different types of genome rearrangement operators such as reversals, transpositions, translocations, block interchange, double cut and join (DCJ) etc. In this paper we consider reversals and block-interchanges simultaneously and incorporate inverted block-interchange in a heuristic algorithm, which inverts one or both of the two swapped segments of a block-interchange. Experimental results confirm that incorporation of inverted block-interchange always results in a better (or at least equal) sorting sequence.
机译:- 比较基因组学中的经典问题是找到一种最短的进化操作序列,将一个基因组转化为另一个基因组。存在不同类型的基因组重排算子,例如逆转,转置,易位,块交换,双切换和连接(DCJ)等。在本文中,我们考虑同时逆转和块交换,并在启发式算法中加入反相块交换,哪个块交换的两个交换段中的一个或两个。实验结果证实,反相块交换的结合总是导致更好的(或至少相等)排序序列。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号