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

DOI10.1007/978-3-540-69733-6_33zbMATH Open1148.68577OpenAlexW2133671047MaRDI QIDQ3511344FDOQ3511344

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

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

Mathematics Subject Classification ID

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

Cites Work

• Sorting by Transpositions
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial Pattern Matching

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)