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

DOI10.1007/s10878-020-00673-2zbMath1467.90047OpenAlexW3101866468MaRDI QIDQ2025054

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

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00673-2

zbMATH Keywords

approximation algorithmssorting permutationsgenome rearrangements

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Monotone diameter of bisubmodular polyhedra

Cites Work

• Unnamed Item
• A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
• Approximation algorithms for sorting by length-weighted prefix and suffix operations
• Sorting permutations and binary strings by length-weighted rearrangements
• Improved bounds on sorting by length-weighted reversals
• An approximation algorithm for sorting by reversals and transpositions
• The complexity of finding minimum-length generator sequences
• Approximation algorithms for sorting permutations by fragmentation-weighted operations
• \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• On sorting unsigned permutations by double-cut-and-joins
• 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
• Combinatorial Pattern Matching

This page was built for publication: Length-weighted \(\lambda\)-rearrangement distance