Permutation patterns in genome rearrangement problems

08/08/2018
by   Giulio Cerbai, et al.
0

In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More specifically, for any k, we provide a characterization of the set of permutations having distance ≤ k from the identity (which is known to be a permutation class) in terms of what we call generating permutations and we describe some properties of its basis, which allow to compute such a basis for small values of k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2019

Permutation patterns in genome rearrangement problems: the reversal model

In the context of the genome rearrangement problem, we analyze two well ...
research
08/31/2020

Sorting by Prefix Block-Interchanges

We initiate the study of sorting permutations using prefix block-interch...
research
02/06/2023

Permutation resemblance

Motivated by the problem of constructing bijective maps with low differe...
research
02/08/2023

An Algorithm to Enumerate Grid Signed Permutation Classes

In this paper, we present an algorithm that enumerates a certain class o...
research
10/17/2019

Algorithmic coincidence classification of mesh patterns

We review and extend previous results on coincidence of mesh patterns. W...
research
05/20/2019

Prefix Block-Interchanges on Binary and Ternary Strings

The genome rearrangement problem computes the minimum number of operatio...
research
10/12/2021

On Permutation Invariant Problems in Large-Scale Inference

Simultaneous statistical inference problems are at the basis of almost a...

Please sign up or login with your details

Forgot password? Click here to reset