A new approximation algorithm for unsigned translocation sorting

DOI10.1007/978-3-319-43681-4_22MaRDI QIDQ1708438zbMATH OpenOpenAlexFDO

Authors Lianrong Pu, Daming Zhu, Haitao Jiang

Publication date 23 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43681-4_22

zbMATH Keywords

algorithmapproximationcomplexitygenomerearrangementtranslocation

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• A 1.375-approximation algorithm for unsigned translocation sorting
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• A simpler 1.5-approximation algorithm for sorting by transpositions
• A new approximation algorithm for sorting of signed permutations
• A 1.75-approximation algorithm for unsigned translocation distance
• Algorithms and Computation

Cited in

(9)

• A 1.375-approximation algorithm for unsigned translocation sorting
• A 1.75-approximation algorithm for unsigned translocation distance
• A (1.408+ )-approximation algorithm for sorting unsigned genomes by reciprocal translocations
• A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
• A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
• Algorithms and Computation
• A randomized FPT approximation algorithm for sorting unsigned genomes by translocations: breaking the 1.375 approximation barrier
• On the complexity of unsigned translocation distance
• A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations

This page was built for publication: A new approximation algorithm for unsigned translocation sorting

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