Faster algorithms for sorting by transpositions and sorting by block interchanges
From MaRDI portal
Publication:3580936
Recommendations
- Theory and Applications of Models of Computation
- The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- An improved block-interchange algorithm
- An improved algorithm for sorting by block-interchanges based on permutation groups
Cited in
(14)- Fast Intersection Algorithms for Sorted Sequences
- An improved block-interchange algorithm
- Theory and Applications of Models of Computation
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
- Approximation algorithms for sorting by bounded singleton moves
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- An improved algorithm for sorting by block-interchanges based on permutation groups
- A New and Faster Method of Sorting by Transpositions
- The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time
- Approximation algorithms for sorting permutations by extreme block-interchanges
- Block Sorting Is APX-Hard
- Sorting on graphs by adjacent swaps using permutation groups
- Constant time and space updates for the sigma-tau problem
This page was built for publication: Faster algorithms for sorting by transpositions and sorting by block interchanges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580936)