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 The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time http://arxiv.org/abs/0910.3292 2009 CoRR abs/0910.3292 db/journals/corr/corr0910.html#abs-0910-3292 informal publication