Can a permutation be sorted by best short swaps?

A short swap switches two elements with at most one element caught between them. Sorting permutation by short swaps asks to find a shortest short swap sequence to transform a permutation into another. A short swap can eliminate at most three inversions. It is still open for whether a permutation can be sorted by short swaps each of which can eliminate three inversions. In this paper, we present a polynomial time algorithm to solve the problem, which can decide whether a permutation can be sorted by short swaps each of which can eliminate 3 inversions in O(n) time, and if so, sort the permutation by such short swaps in O(n^2) time, where n is the number of elements in the permutation. A short swap can cause the total length of two element vectors to decrease by at most 4. We further propose an algorithm to recognize a permutation which can be sorted by short swaps each of which can cause the element vector length sum to decrease by 4 in O(n) time, and if so, sort the permutation by such short swaps in O(n^2) time. This improves upon the O(n^2) algorithm proposed by Heath and Vergara to decide whether a permutation is so called lucky.

[1]  Mark Jerrum,et al.  The Complexity of Finding Minimum-Length Generator Sequences , 1985, Theor. Comput. Sci..

[2]  Lenwood S. Heath,et al.  Sorting by Short Swaps , 2003, J. Comput. Biol..

[3]  Vineet Bafna,et al.  Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..

[4]  P. Pevzner,et al.  Genome-scale evolution: reconstructing gene orders in the ancestral species. , 2002, Genome research.

[5]  David Sankoff,et al.  Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.

[6]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[7]  Zanoni Dias,et al.  Approximation algorithms for sorting by signed short reversals , 2014, BCB.

[8]  D. Sankoff,et al.  Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Zanoni Dias,et al.  Sorting signed permutations by short operations , 2015, Algorithms for Molecular Biology.

[10]  Marek Karpinski,et al.  1.375-Approximation Algorithm for Sorting by Reversals , 2002, ESA.

[11]  Ivan Hal Sudborough,et al.  A FAST ALGORITHM FOR SORTING BY SHORT SWAP , .

[12]  Alberto Caprara,et al.  Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..

[13]  P. Pevzner,et al.  Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. , 2003, Genome research.

[14]  Haim Kaplan,et al.  Sorting signed permutations by reversals, revisited , 2005, J. Comput. Syst. Sci..

[15]  P. V. Vara Prasad,et al.  Evaluation of Wheat Chromosome Translocation Lines for High Temperature Stress Tolerance at Grain Filling Stage , 2015, PloS one.