Approximation algorithms for sorting by \(k\)-cuts on signed permutations

DOI10.1007/s10878-022-00937-zOpenAlexW4309236104MaRDI QIDQ2099384

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

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 algorithmssorting permutationsgenome rearrangements

Mathematics Subject Classification ID

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

Cites Work

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

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