202 search results - page 8 / 41 » Counting Distance Permutations |
STOC
1995
ACM
13 years 11 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
SIAMDM
2010
13 years 2 months ago
2010
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Topological crossovers are a class of representation-independent operators that are well-defined once a notion of distance over the solution space is defined. In this pap...
ECCC
2006
13 years 7 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...