Sorting by \(k\)-cuts on signed permutations

DOI10.1007/978-3-031-06220-9_11zbMath1496.92053OpenAlexW4285266128MaRDI QIDQ2163961

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

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06220-9_11

zbMATH Keywords

algorithmic complexityapproximation algorithmssorting permutationsgenome rearrangements

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

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

Cites Work

• Unnamed Item
• Sorting permutations by block-interchanges
• Sorting by multi-cut rearrangements
• Multi-break rearrangements and chromosomal evolution
• A very elementary presentation of the Hannenhalli-Pevzner theory
• 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: Sorting by \(k\)-cuts on signed permutations