This paper revisits the problem of sorting by reversals with tools developed in the context of detecting common intervals. Mixing the two approaches yields new definitions and algorithms for the reversal distance computations, that apply directly on the original permutation
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
Given a permutation pi, the application of prefix reversal f((i)) to pi reverses the order of the fi...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
Abstract. In the last decade there has been an ongoing interest in string comparison problems; to a ...
The problem of estimating evolutionary distance from differences in gene order has been distilled to...
We show that sorting by reversals can be performed in polynomial time when the number of breakpoints...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
AbstractFor a string A=a1…an, a reversal ρ(i,j), 1⩽i⩽j⩽n, transforms the string A into a string A′=a...
Click on the DOI link below to access the article (may not be free).We show that a special case of s...
International audienceBackgroundThe reversal distance and optimal sequences of reversals to transfor...
Abstract. We study the String Reversal Distance problem, an ex-tension of the well-known Sorting by ...
For a string A = a1... an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a stri...
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
Given a permutation pi, the application of prefix reversal f((i)) to pi reverses the order of the fi...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
Abstract. In the last decade there has been an ongoing interest in string comparison problems; to a ...
The problem of estimating evolutionary distance from differences in gene order has been distilled to...
We show that sorting by reversals can be performed in polynomial time when the number of breakpoints...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
AbstractFor a string A=a1…an, a reversal ρ(i,j), 1⩽i⩽j⩽n, transforms the string A into a string A′=a...
Click on the DOI link below to access the article (may not be free).We show that a special case of s...
International audienceBackgroundThe reversal distance and optimal sequences of reversals to transfor...
Abstract. We study the String Reversal Distance problem, an ex-tension of the well-known Sorting by ...
For a string A = a1... an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a stri...
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
Given a permutation pi, the application of prefix reversal f((i)) to pi reverses the order of the fi...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
DOI
Add to ORKG