On the diameter of the pancake network
Journal of Algorithms
SIAM Journal on Discrete Mathematics
Sorting by bounded block-moves
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Discrete Mathematics
Sorting Strings by Reversals and by Transpositions
SIAM Journal on Discrete Mathematics
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Reversals and Transpositions Over Finite Alphabets
SIAM Journal on Discrete Mathematics
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics
Bounding Prefix Transposition Distance for Strings and Permutations
HICSS '08 Proceedings of the Proceedings of the 41st Annual Hawaii International Conference on System Sciences
On transforming sequences
Genome rearrangements and sorting by reversals
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
An (18/11)n upper bound for sorting by prefix reversals
Theoretical Computer Science
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Combinatorics of Genome Rearrangements
Combinatorics of Genome Rearrangements
An improved 1.375-approximation algorithm for the transposition distance problem
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 5.23 |
A transposition is an operation that exchanges two adjacent substrings. Transpositions over permutations, the sequences with no repeated symbols, are related to genome rearrangements. If one of the substrings is restricted to a prefix then it is called a prefix transposition. The prefix transposition distance between a pair of strings (permutations) is the minimum number of prefix transpositions required to transform a given string (permutation) into another given string (permutation). For a permutation of length n, we improve the current prefix transposition distance upper bound of n-log"8n to n-log"9"/"2n. For arbitrary strings, we prove new prefix transposition distance upper and lower bounds. For binary strings of length n, we show that n/2 is an upper bound. We show that the prefix transposition distance problem is NP-complete for binary strings.