Prefix transpositions on binary and ternary strings

Authors:
Amit Kumar Dutta;Masud Hasan;M. Sohel Rahman
Affiliations:
Department of Computer Science & Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science & Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science & Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
Information Processing Letters
Year:
2013

Citing 4
Cited 0

Sorting a bridge hand

Discrete Mathematics
Reversals and Transpositions Over Finite Alphabets

SIAM Journal on Discrete Mathematics
Assignment of Orthologous Genes via Genome Rearrangement

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Prefix Reversals on Binary and Ternary Strings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

The problem of sorting by prefix transpositions asks for the minimum number of prefix transpositions required to sort the elements of a given permutation. In this paper, we study a variant of this problem where the prefix transpositions act not on permutations but on strings over an alphabet of fixed size. Here, we determine the minimum number of prefix transpositions required to sort the binary and ternary strings, with polynomial time algorithms for these sorting problems.