Sciweavers

Share
15 search results - page 1 / 3
» Pattern Matching for 321-Avoiding Permutations
Sort
View
ISAAC
2009
Springer
245views Algorithms» more  ISAAC 2009»
10 years 6 months ago
Pattern Matching for 321-Avoiding Permutations
Sylvain Guillemot, Stéphane Vialette
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
9 years 11 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
DM
2006
91views more  DM 2006»
9 years 11 months ago
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
Alexander Burstein, Sergi Elizalde, Toufik Mansour
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
9 years 11 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
ICALP
2001
Springer
10 years 4 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...
books