RT Journal Article
SR Electronic
T1 The 2-approximation algorithm of sorting by prefix transposition revisited
JF bioRxiv
FD Cold Spring Harbor Laboratory
SP 036814
DO 10.1101/036814
A1 Md. Shafiqul Islam
A1 Md. Khaledur Rahman
A1 M. Sohel Rahman
YR 2016
UL http://biorxiv.org/content/early/2016/01/15/036814.abstract
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).