Sorting by Prefix Block-Interchanges

08/31/2020
by   Anthony Labarre, et al.
0

We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to transform a given permutation into the identity permutation using as few such operations as possible. We give a 2-approximation algorithm for this problem, show how to obtain improved lower and upper bounds on the corresponding distance, and determine the largest possible value for that distance.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/30/2020

An algebraic 1.375-approximation algorithm for the Transposition Distance Problem

In genome rearrangements, the mutational event transposition swaps two a...
10/22/2021

The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model

We study the connections between sorting and the binary search tree mode...
08/04/2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

We propose a conceptually simple oblivious sort and oblivious random per...
08/08/2018

Permutation patterns in genome rearrangement problems

In the context of the genome rearrangement problem, we analyze two well ...
01/23/2020

Sorting Permutations with Fixed Pinnacle Set

We give a positive answer to a question raised by Davis et al. ( Discret...
05/20/2019

Prefix Block-Interchanges on Binary and Ternary Strings

The genome rearrangement problem computes the minimum number of operatio...
10/28/2017

Minimax Rates and Efficient Algorithms for Noisy Sorting

There has been a recent surge of interest in studying permutation-based ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.