scientific article; zbMATH DE number 7286740

DOI10.4230/LIPICS.CPM.2018.14MaRDI QIDQ5140777zbMATH OpenFDO

Authors Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng

Publication date 16 December 2020

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2018.14

zbMATH Keywords

complexitypermutationreversalshort swap

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Sorting a permutation by best short swaps
• Sorting arrays by means of swaps
• scientific article; zbMATH DE number 910920
• Sorting by swaps with noisy comparisons
• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• Sorting permutations by reversals through branch-and-price
• Sorting permutations by limited-size operations
• Sorted and/or sortable permutations
• Sorting of Permutations by Cost-Constrained Transpositions
• Sorting permutations by block-interchanges

Cites work

• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• scientific article; zbMATH DE number 3900155 (Why is no real title available?)
• scientific article; zbMATH DE number 1947393 (Why is no real title available?)
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Transforming cabbage into turnip

Cited in

(2)

• Sorting a permutation by best short swaps
• Sorting arrays by means of swaps

This page was built for publication:

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