On sorting by 3-bounded transpositions

DOI10.1016/j.disc.2005.06.035zbMath1096.68035OpenAlexW2178772003MaRDI QIDQ2497524

Yanyan Li

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

zbMATH Keywords

sortingapproximationgenome rearrangementbounded transpositions

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items (3)

Approximation algorithms for sorting by bounded singleton moves ⋮ An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves ⋮ A \((1+\varepsilon)\)-approximation algorithm for sorting 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

This page was built for publication: On sorting by 3-bounded transpositions