A 14/11-approximation algorithm for sorting by short block-moves

DOI10.1007/s11432-010-4131-5zbMath1214.68464OpenAlexW2069004435MaRDI QIDQ543206

Daming Zhu, Haitao Jiang

Publication date: 17 June 2011

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4131-5

zbMATH Keywords

approximation algorithmshort block-move

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (5)

Approximation algorithms for sorting by bounded singleton moves ⋮ Quasi-linear modeling of gyroresonance between different MLT chorus and geostationary orbit electrons ⋮ An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves ⋮ A cost-sharing method for the multi-level economic lot-sizing game ⋮ Sorting a permutation by best short swaps

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of unsigned translocation distance
• Sorting by bounded block-moves
• Sorting by short block-moves
• Transforming cabbage into turnip
• A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals
• Theory and Applications of Models of Computation
• Polynomial-time algorithm for computing translocation distance between genomes

This page was built for publication: A 14/11-approximation algorithm for sorting by short block-moves