An approximation algorithm for sorting by reversals and transpositions

Authors:
Atif Rahman;Swakkhar Shatabda;Masud Hasan
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka-1000, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka-1000, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka-1000, Bangladesh
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 12
Cited 3

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Sorting by Transpositions

SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions

Theoretical Computer Science - Special issue: Genome informatics
A 3/2-approximation algorithm for sorting by reversals

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Sorting a bridge hand

Discrete Mathematics
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
(1 + ɛ)-Approximation of sorting by reversals and transpositions

Theoretical Computer Science
1.375-Approximation Algorithm for Sorting by Reversals

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simpler 1.5-approximation algorithm for sorting by transpositions

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Signed genome rearrangement by reversals and transpositions: models and approximations

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A 1.375-approximation algorithm for sorting by transpositions

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

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

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals

Journal of Computer Science and Technology
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a 2k-approximation algorithm for sorting by reversals and transpositions for unsigned permutations where k is the approximation ratio of the algorithm used for cycle decomposition. For the best known value of k our approximation ratio becomes 2.8386+@d for any @d0. We also derive a lower bound on reversal and transposition distance of an unsigned permutation.