Click on the DOI link below to access the article (may not be free).We show that a special case of sorting by reversals can be performed in polynomial time, namely, when the number of breakpoints is twice the distance.peer reviewe
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal co...
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in comp...
Reversals and transpositions are two classic genome rearrangement operations. Reversals occur when a...
We show that sorting by reversals can be performed in polynomial time when the number of breakpoints...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
The problem of estimating evolutionary distance from differences in gene order has been distilled to...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions n...
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
AbstractWe study the problem of sorting binary sequences and permutations by length-weighted reversa...
International audienceA sequence of reversals that takes a signed permutation to the identity is per...
Abstract. In comparative genomics, a transposition is an operation that exchanges two consecutive se...
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal co...
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in comp...
Reversals and transpositions are two classic genome rearrangement operations. Reversals occur when a...
We show that sorting by reversals can be performed in polynomial time when the number of breakpoints...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
The problem of estimating evolutionary distance from differences in gene order has been distilled to...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
This paper revisits the problem of sorting by reversals with tools developed in the context of detec...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions n...
Bergeron A, Heber S, Stoye J. Common intervals and sorting by reversals: a marriage of necessity. Bi...
AbstractWe study the problem of sorting binary sequences and permutations by length-weighted reversa...
International audienceA sequence of reversals that takes a signed permutation to the identity is per...
Abstract. In comparative genomics, a transposition is an operation that exchanges two consecutive se...
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal co...
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in comp...
Reversals and transpositions are two classic genome rearrangement operations. Reversals occur when a...
DOI
Add to ORKG