A (1.5 + ε)-approximation algorithm for unsigned translocation distance

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

11 Scopus Citations
View graph of relations


Related Research Unit(s)


Original languageEnglish
Pages (from-to)56-66
Journal / PublicationIEEE/ACM Transactions on Computational Biology and Bioinformatics
Issue number1
Publication statusPublished - Jan 2008


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 the unsigned translocation distance that improves upon the best known 1.75-ratio. The runtime of our algorithm is O(n2 + (4/5)1.5 √log(4/ε)24/ε), where n is the total number of genes in the genome. © 2008 IEEE.

Research Area(s)

  • Approximation algorithms, Genome rearrangement, Unsigned translocation