On the average number of reversals needed to sort signed permutations

DOI10.1016/J.DAM.2017.09.014zbMath1375.05009OpenAlexW2765453722WikidataQ58001378 ScholiaQ58001378MaRDI QIDQ1682880

Mauricio Ayala-Rincón, Thaynara Arielly de Lima

Publication date: 6 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.09.014

zbMATH Keywords

average number of reversalscombinatorics of permutationssorting signed permutations by reversal

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (2)

Improved upper bound for sorting permutations by prefix transpositions ⋮ Uniquely pressable graphs: characterization, enumeration, and recognition

Cites Work

• Sorting permutations by block-interchanges
• The average number of block interchanges needed to sort a permutation and a recent result of Stanley
• On the tightness of the alternating-cycle lower bound for sorting by reversals
• The distribution of cycles in breakpoint graphs of signed permutations
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Genome Rearrangements and Sorting by Reversals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the average number of reversals needed to sort signed permutations