2014 47th Hawaii International Conference on System Sciences (2008)

Waikoloa, Big Island, Hawaii

Jan. 7, 2008 to Jan. 10, 2008

ISSN: 1530-1605

ISBN: 0-7695-3075-3

pp: 469

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.2008.75

ABSTRACT

A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The prefix transposition distance between a pair of strings (permutations) is the shortest sequence of prefix transpositions required to transform a given string (permutation) into another given string (permutation). This problem is a variation of the transposition distance problem, related to genome rearrangements. An upper bound of n-1 and a lower bound of n/2 are known. We improve the bounds to n- log8 n and 2n/3 respectively. We also give upper and lower bounds for the prefix transposition distance on strings. For example, n/2 prefix transpositions are always sufficient for binary strings. We also prove that the exact prefix transposition distance problem on strings is NP complete.

INDEX TERMS

CITATION

Bhadrachalam Chitturi,
I. Hal Sudborough,
"Bounding Prefix Transposition Distance for Strings and Permutations",

*2014 47th Hawaii International Conference on System Sciences*, vol. 00, no. , pp. 469, 2008, doi:10.1109/HICSS.2008.75