Approximation algorithms for sorting permutations by fragmentation-weighted operations

DOI10.1007/978-3-319-91938-6_5zbMATH Open1392.92056OpenAlexW2803410972MaRDI QIDQ1660115FDOQ1660115

Authors: Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias 

Publication date: 15 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-91938-6_5

Recommendations

• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• Approximation algorithms for sorting permutations by extreme block-interchanges
• Approximation algorithms for sorting by length-weighted prefix and suffix operations
• Approximation algorithms for sorting by \(k\)-cuts on signed permutations
• A new approximation algorithm for sorting of signed permutations
• Sorting permutations by limited-size operations
• An approximation algorithm for sorting by reversals and transpositions
• scientific article; zbMATH DE number 2099510
• Sorting of Permutations by Cost-Constrained Transpositions

zbMATH Keywords

approximation algorithmssorting permutationsgenome rearrangements

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Problems related to evolution (92D15) Approximation algorithms (68W25)

Cited In (4)

• Length-weighted \(\lambda\)-rearrangement distance
• Title not available (Why is that?)
• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• Approximation algorithms for sorting by length-weighted prefix and suffix operations

This page was built for publication: Approximation algorithms for sorting permutations by fragmentation-weighted operations

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