The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlog n) Time
classification
💻 cs.DS
cs.DM
keywords
algorithmtimeapproximationrunningspbtimprovepermutationsorting
read the original abstract
Sorting a Permutation by Transpositions (SPbT) is an important problem in Bioinformtics. In this paper, we improve the running time of the best known approximation algorithm for SPbT. We use the permutation tree data structure of Feng and Zhu and improve the running time of the 1.375 Approximation Algorithm for SPbT of Elias and Hartman to $O(n\log n)$. The previous running time of EH algorithm was $O(n^2)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.