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

DOI10.1007/978-3-540-69733-6_33MaRDI QIDQ3511344zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
• An approximation algorithm for sorting by reversals and transpositions
• A 1.375-approximation algorithm for unsigned translocation sorting
• A new approximation algorithm for unsigned translocation sorting
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions

Cites work

• scientific article; zbMATH DE number 1263193 (Why is no real title available?)
• scientific article; zbMATH DE number 1947393 (Why is no real title available?)
• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• A simpler 1.5-approximation algorithm for sorting by transpositions
• An approximation algorithm for sorting by reversals and transpositions
• Combinatorial Pattern Matching
• Short proofs for cut-and-paste sorting of permutations
• Sorting by Transpositions

Cited in

(3)

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

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

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