Approximation algorithms for sorting permutations by length-weighted short rearrangements

DOI10.1016/j.entcs.2019.08.004OpenAlexW2977526487WikidataQ113317429 ScholiaQ113317429MaRDI QIDQ2132329

Guilherme Henrique Santos Miranda, Zanoni Dias, Carla Negri Lintzmayer, Alexsandro Oliveira Alexandrino

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.004

zbMATH Keywords

approximation algorithmssorting permutationsgenome rearrangements

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

Length-weighted \(\lambda\)-rearrangement distance

Cites Work

• Unnamed Item
• A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
• An approximation algorithm for sorting by reversals and transpositions
• The complexity of finding minimum-length generator sequences
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• Sorting by Transpositions Is Difficult
• Transforming cabbage into turnip
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions

This page was built for publication: Approximation algorithms for sorting permutations by length-weighted short rearrangements