The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time
We improve the running time from O(n 2) to O(nlogn) of the existing best known 1.375−approximation algorithm for sorting by transpositions with the help of the permutation tree data structure.
KeywordsApproximation Algorithm Binary Search Tree Open Gate Mutation Tree Oriented Cycle
Unable to display preview. Download preview PDF.