Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents

DOI10.1016/j.tcs.2010.03.008zbMath1207.05003WikidataQ60692284 ScholiaQ60692284MaRDI QIDQ974742

Elisa Pergola, Mathilde Bouvel

Publication date: 7 June 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.008

zbMATH Keywords

permutations; poset; bijection; Dyck paths; duplication-loss model; non-interval subsets

Mathematics Subject Classification ID

05A19: Combinatorial identities, bijective combinatorics

05A05: Permutations, words, matrices

92D10: Genetics and epigenetics

Related Items

The combinatorics of tandem duplication, Minimal permutations and 2-regular skew tableaux, Minimal permutations with \(d\) descents, Permutation patterns in genome rearrangement problems: the reversal model

Uses Software

• InsEnc
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Partially well-ordered closed sets of permutations
• A variant of the tandem duplication-random loss model of genome rearrangement
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Permutations avoiding two patterns of length three
• Three-letter-pattern avoiding permutations and functional equations
• Enumerating permutations avoiding three Babson-Steingrímsson patterns
• On the tandem duplication-random loss model of genome rearrangement
• ECO:a methodology for the enumeration of combinatorial objects
• The On-Line Encyclopedia of Integer Sequences
• Enumeration Schemes for Restricted Permutations
• Restricted permutations