The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval. B\'erard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed permutations by reversals. Combinatorial properties of this family of trees are essential to the algorithm analysis. Here, we use the expectedarXiv:1201.0940v1 fatcat:2rxjeisa2fazncu6b32tgwph6m