By studying current sequential algorithms, this paper presents two parallel algorithms with O(lg~2n) and O(lgn) time complexities for computing reversal distance of signed permutation and a linear time parallel algorithm for reversal sorting.

• 基因组序列在遗传过程中最常见变异现象为部分子序列翻转。 通过对翻转排序问题串行算法的研究，在PRAM模型和LARPBS模型上分别设计出时间复杂度为O(lg~2n)和O(lgn)的并行计算有向符号序列翻转距离算法(n为序列的长度)；