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]. © 2007 Elsevier Inc. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 1045-1059 |
| Journal | Journal of Computer and System Sciences |
| Volume | 73 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - Nov 2007 |
Research Keywords
- Approximation algorithm
- Unsigned translocation distance
Fingerprint
Dive into the research topics of 'A 1.75-approximation algorithm for unsigned translocation distance'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver