85 search results - page 1 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
WABI
2005
Springer
13 years 10 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
ICCD
2002
IEEE
14 years 1 months ago
2002
IEEE
Subword parallelism has succeeded in accelerating many multimedia applications. Subword permutation instructions have been proposed to efficiently rearrange subwords in or among r...
RSA
2002
13 years 4 months ago
2002
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
DM
2007
13 years 4 months ago
2007
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...