(1 + ɛ)-Approximation of sorting by reversals and transpositions

Authors:
Niklas Eriksen
Affiliations:
Department of Mathematics, Royal Institute of Technology, S-100 44 Stockholm, Sweden
Venue:
Theoretical Computer Science
Year:
2002

Citing 8
Cited 12

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 Transpositions

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

Theoretical Computer Science - Special issue: Genome informatics
Sorting Permutations by Reversals and Eulerian Cycle Decompositions

SIAM Journal on Discrete Mathematics
Faster and simpler algorithm for sorting signed permutations by reversals

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
1.375-Approximation Algorithm for Sorting by Reversals

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Fast Sorting by Reversal

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching

Gossip is synteny: incomplete gossip and the syntenic distance between genomes

Journal of Algorithms
Reversal and transposition medians

Theoretical Computer Science
Faster algorithms for sorting by transpositions and sorting by block interchanges

ACM Transactions on Algorithms (TALG)
An approximation algorithm for sorting by reversals and transpositions

Journal of Discrete Algorithms
Expected number of breakpoints after t random reversals in genomes with duplicate genes

Discrete Applied Mathematics
Block sorting: a characterization and some heuristics

Nordic Journal of Computing
Genome rearrangement algorithms for unsigned permutations with O(log n) singletons

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The transposition median problem is NP-complete

Theoretical Computer Science
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals

Journal of Computer Science and Technology
Faster algorithms for sorting by transpositions and sorting by block-interchanges

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Sorting by weighted reversals, transpositions, and inverted transpositions

RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
The complexity of string partitioning

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	5.23

Visualization

Abstract

Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions needed to sort a permutation. There is evidence that, from the point of view of computational molecular biology, a more adequate objective function is obtained, if transpositions are given double weight. We present a (1 + ε)-approximation for this problem, based on the exact algorithm of Hannenhalli and Pevzner for sorting by reversals only.