On sorting by 3-bounded transpositions
From MaRDI portal
Publication:2497524
DOI10.1016/j.disc.2005.06.035zbMath1096.68035MaRDI QIDQ2497524
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.035
Related Items
A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves, Approximation algorithms for sorting by bounded singleton moves, An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
Cites Work
- Unnamed Item
- Unnamed Item
- Sorting by bounded block-moves
- Sorting by short block-moves
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
- Sorting by Transpositions
- Genome Rearrangements and Sorting by Reversals
- Sorting a bridge hand