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
Probability models for genome rearrangement and linear invariants for phylogenetic inference
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
(1+epsilon)-Approximation of Sorting by Reversals and Transpositions
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Reversal and transposition medians
Theoretical Computer Science
Expected number of breakpoints after t random reversals in genomes with duplicate genes
Discrete Applied Mathematics
| Hi-index | 0.00 |
We look at a problem with motivation from computational biology: Given the number of breakpoints in a permutation (representing a gene sequence), compute the expected number of inversions that have occurred. For this problem, we obtain an analytic approximation that is correct within a percent or two. For the inverse problem, computing the expected number of breakpoints after any number of inversions, we obtain an analytic approximation with an error of less than a hundredth of a breakpoint.