The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time

Authors:
Jesun S. Firoz;Masud Hasan;Ashik Z. Khan;M. Sohel Rahman
Affiliations:
Department of Computer Science and Engineering, BUET, Dhaka, Bangladesh;Department of Computer Science and Engineering, BUET, Dhaka, Bangladesh;Department of Computer Science and Engineering, BUET, Dhaka, Bangladesh;Department of Computer Science and Engineering, BUET, Dhaka, Bangladesh
Venue:
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Year:
2010

Citing 8
Cited 3

Self-adjusting binary search trees

Journal of the ACM (JACM)
Sorting by Transpositions

SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions

Theoretical Computer Science - Special issue: Genome informatics
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
Sorting a bridge hand

Discrete Mathematics
A 1.375-Approximation Algorithm for Sorting by Transpositions

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster algorithms for sorting by transpositions and sorting by block interchanges

ACM Transactions on Algorithms (TALG)
A simpler and faster 1.5-approximation algorithm for sorting by transpositions

Information and Computation

Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions

SIAM Journal on Discrete Mathematics
Analysis and implementation of sorting by transpositions using permutation trees

BSB'11 Proceedings of the 6th Brazilian conference on Advances in bioinformatics and computational biology
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We improve the running time from O(n2) 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.