A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations

DOI10.1007/978-3-540-69733-6_33zbMath1148.68577OpenAlexW2133671047MaRDI QIDQ3511344

Xiaowen Lou, Daming Zhu

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_33

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25)

Related Items (2)

A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations ⋮ Pancake flipping and sorting permutations

Cites Work

• An approximation algorithm for sorting by reversals and transpositions
• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• Short proofs for cut-and-paste sorting of permutations
• A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
• Sorting by Transpositions
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item

This page was built for publication: A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations