PT  - JOURNAL ARTICLE
AU  - Md. Shafiqul Islam
AU  - Md. Khaledur Rahman
AU  - M. Sohel Rahman
TI  - The 2-approximation algorithm of sorting by prefix transposition revisited
AID  - 10.1101/036814
DP  - 2016 Jan 01
TA  - bioRxiv
PG  - 036814
4099  - http://biorxiv.org/content/early/2016/01/15/036814.short
4100  - http://biorxiv.org/content/early/2016/01/15/036814.full
AB  - A transposition is an operation that exchanges two adjacent blocks in a permutation. A prefix transposition always moves a prefix of the permutation to another location. In this article, we use a data structure, called the permutation tree, to improve the running time of the best known approximation algorithm (with approximation ratio 2) for sorting a permutation by prefix transpositions. By using the permutation tree, we improve the running time of the 2-approximation algorithm to O(n log n).