202 search results - page 2 / 41 » Counting Distance Permutations |
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...
DCC
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper introduces and studies the notion of an equidistant frequency permutation array (EFPA). An EFPA of length n = m, distance d and size v is defined to be a v
DM
2008
13 years 5 months ago
2008
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
IANDC
2008
13 years 4 months ago
2008
Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this ...