Faster algorithms for sorting by transpositions and sorting by block-interchanges

  • Authors:

  • Jianxing Feng;Daming Zhu

  • Affiliations:

  • School of Computer Science & Technology, Shandong University, Jinan, P.R. China;School of Computer Science & Technology, Shandong University, Jinan, P.R. China

  • Venue:
  • TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a new data structure–permutation tree to improve the running time of sorting permutation by transpositions and sorting permutation by block-interchanges. The 1.5-approximation algorithm for sorting permutation by transpositions has time complexity $O(n^{\frac{3}{2}} \sqrt{log n})$. By the permutation tree, we can improve this algorithm to achieve time complexity O(nlogn). We can also improve the algorithm for sorting permutation by block interchanges to make its time complexity from O(n2) down to O(nlogn).