Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An O(n2) algorithm for signed translocation
Journal of Computer and System Sciences - Special issue on bioinformatics II
On the complexity of unsigned translocation distance
Theoretical Computer Science
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
An O(n3/2√log(n)) algorithm for sorting by reciprocal translocations
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
A 1.75-approximation algorithm for unsigned translocation distance
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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 unsigned translocation distance which improves upon the best known 1.75-ratio. The running time of our algorithm is O(n^2 + ( 4/ε )^1.5 √log( 4/ε )2 4^ε), where n is the total number of genes in the genome.