Faster algorithms for sorting by transpositions and sorting by block interchanges

DOI10.1145/1273340.1273341zbMath1192.68194OpenAlexW1989711785MaRDI QIDQ3580936

Jianxing Feng, Daming Zhu

Publication date: 14 August 2010

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1273340.1273341

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05) Approximation algorithms (68W25)

Related Items (8)

Sorting on graphs by adjacent swaps using permutation groups ⋮ Approximation algorithms for sorting by bounded singleton moves ⋮ A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations ⋮ Approximation algorithms for sorting permutations by extreme block-interchanges ⋮ CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS ⋮ Sorting by Transpositions Is Difficult ⋮ An improved algorithm for sorting by block-interchanges based on permutation groups ⋮ \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges

This page was built for publication: Faster algorithms for sorting by transpositions and sorting by block interchanges