Add to ORKGthis paper, we study the problem of sorting permutations and circular permutations using as few fixed-length reversals as possible. Our problem is implicit in the popular TOP-SPI
AbstractWe study the problem of sorting binary sequences and permutations by length-weighted reversa...
AbstractThe pancake problem asks for the minimum number of prefix reversals sufficient for sorting a...
International audienceBackgroundTraditional algorithms to solve the problem of sorting by signed rev...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed pe...
Given a permutation pi, the application of prefix reversal f((i)) to pi reverses the order of the fi...
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal co...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
AbstractA popular puzzle TOP-SPIN consists of a permutation of 20 numbered disks on an oval track, w...
AbstractPancake flipping, a famous open problem in computer science, can be formalised as the proble...
AbstractThe problem of sorting signed permutations by reversals (SBR) is a fundamental problem in co...
AbstractA cut-and-paste operation can be a reversal, a transposition, or a transreversal on circular...
AbstractWe study the problem of sorting binary sequences and permutations by length-weighted reversa...
AbstractThe pancake problem asks for the minimum number of prefix reversals sufficient for sorting a...
International audienceBackgroundTraditional algorithms to solve the problem of sorting by signed rev...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
We give a quadratic algorithm for finding the minimum number of reversals needed to sort a signed pe...
Given a permutation pi, the application of prefix reversal f((i)) to pi reverses the order of the fi...
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal co...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biolog...
The rearrangement distance between single-chromosome genomes can be estimated as the minimum number ...
AbstractA popular puzzle TOP-SPIN consists of a permutation of 20 numbered disks on an oval track, w...
AbstractPancake flipping, a famous open problem in computer science, can be formalised as the proble...
AbstractThe problem of sorting signed permutations by reversals (SBR) is a fundamental problem in co...
AbstractA cut-and-paste operation can be a reversal, a transposition, or a transreversal on circular...
AbstractWe study the problem of sorting binary sequences and permutations by length-weighted reversa...
AbstractThe pancake problem asks for the minimum number of prefix reversals sufficient for sorting a...
International audienceBackgroundTraditional algorithms to solve the problem of sorting by signed rev...