Sciweavers

212 search results - page 1 / 43
» On the distance between the expressions of a permutation
Sort
View
EJC
2010
13 years 4 months ago
On the distance between the expressions of a permutation
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
Patrick Dehornoy, Marc Autord
CORR
2004
Springer
168views Education» more  CORR 2004»
13 years 4 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
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...
Andy Auyeung, Ajith Abraham
DM
2008
97views more  DM 2008»
13 years 4 months ago
On uniquely k-determined permutations
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...
Sergey V. Avgustinovich, Sergey Kitaev
AAIM
2008
Springer
110views Algorithms» more  AAIM 2008»
13 years 11 months ago
Fixed-Parameter Algorithms for Kemeny Scores
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...
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf...
MT
2010
110views more  MT 2010»
13 years 2 months ago
Metrics for MT evaluation: evaluating reordering
Translating between dissimilar languages requires an account of the use of divergent word orders when expressing the same semantic content. Reordering poses a serious problem for s...
Alexandra Birch, Miles Osborne, Phil Blunsom