Polynomial-time algorithm for computing translocation distance between genomes
Discrete Applied Mathematics - Special volume on computational molecular biology
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences - Special issue on bioinformatics II
Advances on sorting by reversals
Discrete Applied Mathematics
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
An improved algorithm for sorting by block-interchanges based on permutation groups
Information Processing Letters
Rearrangements in genomes with centromeres part I: translocations
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The problem of chromosome reincorporation in DCJ sorting and halving
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms
Sorting by translocations via reversals theory
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Sorting genomes by generalized translocations
Theoretical Computer Science
| Hi-index | 0.00 |
We prove that sorting by reciprocal translocations can be done in $O(n^{3/2}\sqrt{\log (n)})$ for an n-gene genome. Our algorithm is an adaptation of the Tannier et. al algorithm for sorting by reversals. This improves over the O(n3) algorithm for sorting by reciprocal translocations given by Bergeron et al.