Sorting a permutation by best short swaps

DOI10.1007/S00453-021-00814-XOpenAlexW3133549692MaRDI QIDQ2037101FDOQ2037101

Authors: Shu Zhang, Daming Zhu, Haitao Jiang, Jiong Guo, Haodi Feng, Xiaowen Liu 

Publication date: 30 June 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00814-x

Recommendations

• scientific article; zbMATH DE number 7286740
• Sorting by short block-moves
• Short proofs for cut-and-paste sorting of permutations
• Sorting permutations by block-interchanges
• SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS

zbMATH Keywords

permutationalgorithmcomplexityshort swap

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• A simple algorithm for the constrained sequence problems
• A 14/11-approximation algorithm for sorting by short block-moves
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Transforming cabbage into turnip
• Title not available (Why is that?)
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Sorting by short block-moves
• A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Genome Rearrangements and Sorting by Reversals
• The complexity of finding minimum-length generator sequences
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Sorting a permutation by best short swaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037101)