85 search results - page 8 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
DAM
2007
14 years 9 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
76
Voted
ITP
2010
15 years 1 months ago
2010
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
CPM
2001
Springer
15 years 2 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
SSIAI
2000
IEEE
15 years 2 months ago
2000
IEEE
We introduce a novel method for representing and coding wideband signals using permutations. The signal samples are first sorted, and then encoded using Differential Pulse Coding...