Whole mirror duplication-random loss model and pattern avoiding permutations

DOI10.1016/J.IPL.2010.04.016MaRDI QIDQ656610zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jean-Luc Baril, Rémi Vernay

Publication date 18 January 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.04.016

zbMATH Keywords

binary reflected Gray codecombinatorial problemsgenerating algorithmgenomepattern avoiding permutationwhole duplication-random loss model

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Recommendations

• Posets and permutations in the duplication-loss model
• Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
• A variant of the tandem duplication-random loss model of genome rearrangement
• Permutation patterns in genome rearrangement problems: the reversal model
• scientific article; zbMATH DE number 5831716

Cites work

• A variant of the tandem duplication-random loss model of genome rearrangement
• Counting permutations by their alternating runs
• Efficient generation of the binary reflected gray code and its applications
• Generating alternating permutations lexicographically
• Introduction to partially ordered patterns
• On avoidance of V- and -patterns in permutations.
• On the tandem duplication-random loss model of genome rearrangement
• Posets and permutations in the duplication-loss model
• Runs, Slides and Moments
• The On-Line Encyclopedia of Integer Sequences
• Valleyless sequences

Cited in

(1)

• Posets and permutations in the duplication-loss model

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Whole mirror duplication-random loss model and pattern avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656610)