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

Author

Cui, Yun ; Wang, Lusheng ; Zhu, Daming ; Liu, Xiaowen

Author_Institution

Shandong Univ., Ji´´nan

Volume

5

Issue

1

fYear

2008

Firstpage

56

Lastpage

66

Abstract

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

Keywords

approximation theory; biology computing; cellular biophysics; computational complexity; genetics; molecular biophysics; optimisation; NP-hard problem; approximation algorithm; bioinformatics; computational biology; genome rearrangement; translocation operation; unsigned translocation distance; Genome rearrangement; and approximation algorithms.; unsigned translocation; Algorithms; Chromosomes; Computational Biology; Genome; Models, Genetic; Translocation, Genetic;

fLanguage

English

Journal_Title

Computational Biology and Bioinformatics, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1545-5963

Type

jour

DOI

10.1109/TCBB.2007.70216

Filename

4359874