On the complexity of unsigned translocation distance

Authors:
Daming Zhu;Lusheng Wang
Affiliations:
School of Computer Science and Technology, Shandong University, Jinan, PR China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
Theoretical Computer Science
Year:
2006

Citing 9
Cited 4

Polynomial-time algorithm for computing translocation distance between genomes

Discrete Applied Mathematics - Special volume on computational molecular biology
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Faster and simpler algorithm for sorting signed permutations by reversals

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
Of mice and men: algorithms for evolutionary distances between genomes with translocation

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
To cut…or not to cut (applications of comparative physical maps in molecular evolution)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
An O(n2) algorithm for signed translocation

Journal of Computer and System Sciences - Special issue on bioinformatics II

A 1.75-approximation algorithm for unsigned translocation distance

Journal of Computer and System Sciences
A (1.5 + ε)-Approximation Algorithm for Unsigned Translocation Distance

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Inapproximability of maximal strip recovery

Theoretical Computer Science
A 1.75-approximation algorithm for unsigned translocation distance

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard.