On Sorting by 3-Bounded Transpositions

DOI10.1016/S1571-0653(04)00552-9MaRDI QIDQ3439056zbMATH OpenOpenAlexFDO

Authors Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00552-9

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• On sorting by 3-bounded transpositions
• Sorting permutations with transpositions in \(O(n^3)\) amortized time
• Research in Computational Molecular Biology
• scientific article; zbMATH DE number 1303563
• scientific article; zbMATH DE number 4108986
• Tighter upper bound for sorting permutations with prefix transpositions

Cites work

• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Sorting by short block-moves
• Sorting by Transpositions

Cited in

(3)

• Sorted fibs in base 3/2
• On sorting by 3-bounded transpositions
• A natural extension for the greedy \(\beta\)-transformation with three arbitrary digits

This page was built for publication: On Sorting by 3-Bounded Transpositions

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