A (1.5 + ε)-approximation algorithm for unsigned translocation distance
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 56-66 |
Journal / Publication | IEEE/ACM Transactions on Computational Biology and Bioinformatics |
Volume | 5 |
Issue number | 1 |
Publication status | Published - Jan 2008 |
Link(s)
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+ε)-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
Citation Format(s)
A (1.5 + ε)-approximation algorithm for unsigned translocation distance. / Cui, Yun; Wang, Lusheng; Zhu, Darning et al.
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 5, No. 1, 01.2008, p. 56-66.
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 5, No. 1, 01.2008, p. 56-66.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review