Issue No. 01 - January-March (2008 vol. 5)
Genome rearrangement is an important area in computational biology and bioinformatics. The translocation operation is one of the popular operations for genome rearrangement. It was proved that computing the unsigned translocation distance is NP-hard. In this paper, we present a (1.5 + ε)- approximation algorithm for computing unsigned translocation distance which improves upon the best known 1.75-ratio. The running time of our algorithm is O(n^2 + ( 4/ε )^1.5 √log( 4/ε )2 4^ε), where n is the total number of genes in the genome.
Genome rearrangement, unsigned translocation, and approximation algorithms.
Y. Cui, X. Liu, L. Wang and D. Zhu, "A (1.5 + ε)-Approximation Algorithm for Unsigned Translocation Distance," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 5, no. , pp. 56-66, 2007.