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
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for multichromosomal genome rearrangements
Journal of Computer and System Sciences - Computational biology 2002
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the complexity of unsigned translocation distance
Theoretical Computer Science
A 1.75-approximation algorithm for unsigned translocation distance
Journal of Computer and System Sciences
A (1.5 + ε)-Approximation Algorithm for Unsigned Translocation Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Polynomial-Time Algorithm for Sorting by Generalized Translocations
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms
A 1.75-approximation algorithm for unsigned translocation distance
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Sorting genomes by generalized translocations
Theoretical Computer Science
| Hi-index | 0.00 |
Genome rearrangement is an important area in computational biology. There are three basic operations, reversal, translocation and transposition. Here we study the translocation operations. Multi-chromosomal genomes frequently evolve by translocation events that exchange genetic material between two chromosomes. We focus on the signed case, where the direction of each gene is known. The signed translocation problem asks to find the minimum number of translocation operations as well as the sequence of translocation operations to transform one genome into the other. A linear-time algorithm that computes the minimum number of translocation operations was given in a linear-time algorithm for computing translocation distance between signed genomes [16]. However, that algorithm cannot give the optimum sequence of translocation operations. The best known algorithm that can give the optimum sequence of translocation operations for signed translocation problem runs in O(n^2logn) time. In this paper, we design an O(n^2) algorithm. thm.