A k-bounded (k ≥ 2) transposition is an operation that switches two elements that have at most k - 2 elements in between. We study the problem of sorting a circular permutation π of length n for k = 2, i.e., adjacent swaps and k = 3, i.e., short swaps. These transpositions mimic microrearrangements of gene order in viruses and bacteria. We prove a (1/4)n (2) lower bound for sorting by adjacent swaps. We show upper bounds of (5/32)n (2) + O(n log n) and (7/8)n + O(log n) for sequential and parallel sorting, respectively, by short swaps.
We give new lower bounds for M (n, d), for various positive integers n and d with n > d, where M (n, d) is the largest number of permutations on n symbols with pairwise Hamming distance at least d. Large sets of permutations on n symbols with pairwise Hamming distance d are needed for constructing error correcting permutation codes, which have been proposed for power-line communications. Our technique, partition and extension, is universally applicable to constructing such sets for all n and all d, d < n. We describe three new techniques, sequential partition and extension, parallel partition and extension, and a modified Kronecker product operation, which extend the applicability of partition and extension in different ways. We describe how partition and extension gives improved lower bounds for M (n, n − 1) using mutually orthogonal Latin squares (MOLS). We present efficient algorithms for computing new partitions: an iterative greedy algorithm and an algorithm based on integer linear programming. These algorithms yield partitions of positions (or symbols) used as input to our partition and extension techniques. We report many new lower bounds for M (n, d) found using these techniques for n up to 600.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.