On the average number of reversals needed to sort signed permutations
type: Item
instance of: scholarly article
title: On the average number of reversals needed to sort signed permutations
zbMATH Open document ID: 1375.05009
author: Thaynara Arielly de Lima
author: Mauricio Ayala-Rincón
published in: Discrete Applied Mathematics
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 6815843
zbMATH Keywords: combinatorics of permutations
zbMATH Keywords: sorting signed permutations by reversal
zbMATH Keywords: average number of reversals
MaRDI profile type: Publication
full work available at URL: j.dam.2017.09.014
OpenAlex ID: W2765453722
Wikidata QID: Q58001378
cites work: Genome Rearrangements and Sorting by Reversals
cites work: The average number of block interchanges needed to sort a permutation and a recent result of Stanley
cites work: On the tightness of the alternating-cycle lower bound for sorting by reversals
cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions
cites work: Sorting permutations by block-interchanges
cites work: Q5387506
cites work: The distribution of cycles in breakpoint graphs of signed permutations
cites work: Q4234063
cites work: Q5457093
cites work: Q3629755
DOI: 10.1016/J.DAM.2017.09.014
description: scientific article; zbMATH DE number 6815843