title: The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time.
abstract: Sorting a permutation by transpositions (SPbT) is an important problem in bioinformtics. In this article, we improve the running time of the best known approximation algorithm for SPbT.
authors.affiliation: Department of CSE, BUET, Dhaka, Bangladesh.
authors.forename: Jesun Sahariar
authors.initials: JS
authors.lastname: Firoz
authors.forename: Masud
authors.initials: M
authors.lastname: Hasan
authors.forename: Ashik Zinnat
authors.initials: AZ
authors.lastname: Khan
authors.forename: M Sohel
authors.initials: MS
authors.lastname: Rahman
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*