For the problem of sorting signed genomes, a sorting operation can change both the gene sequence and the signs of genes.

对于无向基因组的重组排序问题，重组排序操作只改变基因序列，不会改变基因的符号。

youdao

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

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

youdao

Secondly we formulate the optimization problem of sorting plan using the single machine scheduling problem and sequently illustrate a simple algorithm. Finally, the method is acco...

其次，利用机器排序问题处理解体计划问题，并给出一简单算法，由此得到优化的解体计划时间表。

youdao

And the context of sorting, the worst case is your handed a problem that's in complete reverse order because that implies you have - to do as more work that could possibly-- that you could-- you have to do more work than you would of course if things were in perfect order.

在排序的环境中，最糟糕的情况是待排序的序列是,完全逆序的，在这种情况下,你不得不做更多的工作-,比起一个较理想顺序的序列,你必须花费更多的努力。

哈佛公开课 - 计算机科学课程节选