By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yun Cui ; Shandong Univ., Ji''nan ; Lusheng WAng ; Daming Zhu ; Xiaowen Liu

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+epsiv)-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/epsiv)1.5radic(log(4/epsiv)24/epsiv)), where n is the total number of genes in the genome.

Published in:

Computational Biology and Bioinformatics, IEEE/ACM Transactions on  (Volume:5 ,  Issue: 1 )