Approximation algorithms for sorting by k-cuts on signed permutations

DOI10.1007/S10878-022-00937-ZMaRDI QIDQ2099384zbMATH OpenOpenAlexFDO

Authors Andre Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias

Publication date 23 November 2022

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

Full work available at URL https://doi.org/10.1007/s10878-022-00937-z

zbMATH Keywords

algorithmic complexityapproximation algorithmsgenome rearrangementssorting permutations

Mathematics Subject Classification ID

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

Recommendations

• Sorting by \(k\)-cuts on signed permutations
• Sorting by multi-cut rearrangements
• A new approximation algorithm for sorting of signed permutations
• An approximation algorithm for sorting by reversals and transpositions
• scientific article; zbMATH DE number 1405677

Cites work

• Combinatorics of genome rearrangements.
• Multi-break rearrangements and chromosomal evolution
• Signed genome rearrangement by reversals and transpositions: Models and approximations
• Sorting by \(k\)-cuts on signed permutations
• Sorting by multi-cut rearrangements
• Sorting by Transpositions
• Sorting permutations by block-interchanges
• Transforming cabbage into turnip

Cited in

(6)

• Approximation algorithms for sorting permutations by fragmentation-weighted operations
• Sorting by \(k\)-cuts on signed permutations
• On sorting unsigned permutations by double-cut-and-joins
• A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
• Sorting separable permutations by restricted multi-break rearrangements
• Sorting by multi-cut rearrangements

This page was built for publication: Approximation algorithms for sorting by \(k\)-cuts on signed permutations

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