...
首页> 外文期刊>Discrete Applied Mathematics >Sorting by bounded block-moves
【24h】

Sorting by bounded block-moves

机译:按有界移动排序

获取原文
获取原文并翻译 | 示例
           

摘要

Given a permutation pi, a block-move is an operation that switches two adjacent blocks of elements in pi. The problem of finding the minimum number of block-moves required to sort pi has applications in computational biology, particularly in the study of genome rearrangements. This paper investigates variants of the problem where bounds are imposed on the lengths of the blocks moved. Algorithms and reduction results are presented for these variants. (C) 1998 Elsevier Science B.V. All rights reserved. [References: 16]
机译:给定一个置换pi,块移动是切换pi中两个相邻元素块的操作。找出对pi进行排序所需的最小移动量的问题已在计算生物学中应用,尤其是在基因组重排研究中。本文研究了该问题的变体,其中对移动的块的长度施加了限制。给出了这些变体的算法和归约结果。 (C)1998 Elsevier Science B.V.保留所有权利。 [参考:16]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号