Approximating the expected number of inversions given the number of breakpoints

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Eriksen, N. (2002). Approximating the expected number of inversions given the number of breakpoints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2452, pp. 316–333). Springer Verlag. https://doi.org/10.1007/3-540-45784-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free