The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology.

计算分子生物学中的基因组重排，产生了借助于反序来排列有符号排列问题。

youdao

For most problem instances, many minimum sequences of sorting reversals exist, and it is very important to explore the space of genome rearrangements.

在探索基因重排空间问题上，获取最小翻转距离非常有意义。

youdao

The paper proposes a simulated annealing algorithm for the problem of genome rearrangements of the unsigned permutation by reversals, and define the neighborhood structure of its solution.

本文给出一种适合于计算基因无方向的反转基因组重排问题的模拟退火算法，定义了解的邻域结构。

youdao