| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430795 | Journal of Computer and System Sciences | 2007 | 15 Pages |
Abstract
The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75-approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [J. Kececioglu, R. Ravi, Of mice and men: Algorithms for evolutionary distances between genomes with translocation, in: 6th ACM–SIAM Symposium on Discrete Algorithms, 1995, pp. 604–613].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
