A 1.75-approximation algorithm for unsigned translocation distance

Authors:
Yun Cui;Lusheng Wang;Daming Zhu
Affiliations:
School of Computer Science and Technology, Shandong University, P.R.China;Department of Computer Science, City University of HongKong, HongKong;School of Computer Science and Technology, Shandong University, P.R.China
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 1

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
Of mice and men: algorithms for evolutionary distances between genomes with translocation

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A 3/2-approximation algorithm for sorting by reversals

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

SIAM Journal on Computing
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
An O(n2) algorithm for signed translocation

Journal of Computer and System Sciences - Special issue on bioinformatics II
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)
On the complexity of unsigned translocation distance

Theoretical Computer Science
On sorting by translocations

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

A (1.5 + ε)-Approximation Algorithm for Unsigned Translocation Distance

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75-approxi- mation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [1].