Sciweavers

202 search results - page 3 / 41
» Counting Distance Permutations
Sort
View
DM
2000
89views more  DM 2000»
13 years 5 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
CPM
2004
Springer
138views Combinatorics» more  CPM 2004»
13 years 10 months ago
Reversal Distance without Hurdles and Fortresses
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
Anne Bergeron, Julia Mixtacki, Jens Stoye
JCB
2002
102views more  JCB 2002»
13 years 5 months ago
A Lower Bound on the Reversal and Transposition Diameter
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
João Meidanis, Maria Emilia Telles Walter, ...
ICALP
2001
Springer
13 years 9 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
DM
2007
83views more  DM 2007»
13 years 5 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge