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
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
Genome rearrangements and sorting by reversals
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximating the Expected Number of Inversions Given the Number of Breakpoints
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Weighted genomic distance can hardly impose a bound on the proportion of transpositions
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Efficient sampling of transpositions and inverted transpositions for bayesian MCMC
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Genome rearrangement in mitochondria and its computational biology
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
| Hi-index | 0.00 |
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.