85 search results - page 3 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Bit and subword permutations are useful in many multimedia and cryptographic applications. New shift and permute instructions have been added to the instruction set of general-...
BIOCOMP
2006
14 years 11 months ago
2006
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our...
VMCAI
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
114
click to vote
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...