A new approximation algorithm for sorting of signed permutations

DOI10.1007/BF02946661zbMath1025.68028OpenAlexW2008547910MaRDI QIDQ1400064

Yong He, Ting Chen

Publication date: 13 August 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02946661

zbMATH Keywords

combinatorial optimization problemsorting permutations

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cites Work

• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Transforming cabbage into turnip
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals
• Signed genome rearrangement by reversals and transpositions: Models and approximations

This page was built for publication: A new approximation algorithm for sorting of signed permutations