AbstractGiven a permutation π, a block-move is an operation that switches two adjacent blocks of elements in π. The problem of finding the minimum number of block-moves required to sort π has applications in computational biology, particularly in the study of genome rearrangements. This paper investigates variants of the problem where bounds are imposed on the lengths of the blocks moved. Algorithms and reduction results are presented for these variants
The research in this thesis is focused on the problem of Block Sorting, which has applications in Co...
A number of fields, including genome rearrangements and interconnection network design, are concerne...
International audienceThe traditional approach for the problems of sorting permutations by rearrange...
AbstractGiven a permutation π, a block-move is an operation that switches two adjacent blocks of ele...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
In this paper, we study a genome rearrangement primitive called block moves. This primitive as a spe...
AbstractSorting a permutation by block moves is a task that every bridge player has to solve every t...
The Block Sorting problem is to sort a given permutation moving blocks. A block is defined as a subs...
Block Sorting is an APX-hard combinatorial optimization problem motivated by applications in genome ...
A Genome rearrangement problem studies large-scale mutations on a set of DNAs in living organisms. V...
[[abstract]]Given a chromosome represented by a permutation of genes, a block-interchange is propose...
International audienceA number of fields, including the study of genome rearrangements and the desig...
For estimating the evolutionary distance between genomes of two different organisms, many sorting pe...
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any pr...
AbstractThe block sorting problem is the problem of minimizing the number of steps to sort a list of...
The research in this thesis is focused on the problem of Block Sorting, which has applications in Co...
A number of fields, including genome rearrangements and interconnection network design, are concerne...
International audienceThe traditional approach for the problems of sorting permutations by rearrange...
AbstractGiven a permutation π, a block-move is an operation that switches two adjacent blocks of ele...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
In this paper, we study a genome rearrangement primitive called block moves. This primitive as a spe...
AbstractSorting a permutation by block moves is a task that every bridge player has to solve every t...
The Block Sorting problem is to sort a given permutation moving blocks. A block is defined as a subs...
Block Sorting is an APX-hard combinatorial optimization problem motivated by applications in genome ...
A Genome rearrangement problem studies large-scale mutations on a set of DNAs in living organisms. V...
[[abstract]]Given a chromosome represented by a permutation of genes, a block-interchange is propose...
International audienceA number of fields, including the study of genome rearrangements and the desig...
For estimating the evolutionary distance between genomes of two different organisms, many sorting pe...
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any pr...
AbstractThe block sorting problem is the problem of minimizing the number of steps to sort a list of...
The research in this thesis is focused on the problem of Block Sorting, which has applications in Co...
A number of fields, including genome rearrangements and interconnection network design, are concerne...
International audienceThe traditional approach for the problems of sorting permutations by rearrange...
DOI
Add to ORKG