The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n log n)$ Time - Jesun Sahariar Firoz; Masud Hasan; Ashik Zinnat Khan; M. Sohel Rahman (CoRR, 2009)

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time. - Jesun Sahariar Firoz; Masud Hasan; Ashik Zinnat Khan; M. Sohel Rahman (J. Comput. Biol., 2011)