A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
From MaRDI portal
Publication:3550833
DOI10.1007/3-540-44888-8_12zbMath1279.68071OpenAlexW1557841343MaRDI QIDQ3550833
Publication date: 6 April 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44888-8_12
Related Items
Sorting by shuffling methods and a queue, A review of metrics on permutations for search landscape analysis, 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, Multi-break rearrangements and chromosomal evolution, Pancake flipping and sorting permutations, Short proofs for cut-and-paste sorting of permutations, A 14/11-approximation algorithm for sorting by short block-moves, A simpler and faster 1.5-approximation algorithm for sorting by transpositions, Sorting signed permutations by reversals, revisited, On sorting by 3-bounded transpositions, An approximation algorithm for sorting by reversals and transpositions, Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach