Whole mirror duplication-random loss model and pattern avoiding permutations
From MaRDI portal
Publication:656610
DOI10.1016/j.ipl.2010.04.016zbMath1229.94061OpenAlexW2091706343WikidataQ60692196 ScholiaQ60692196MaRDI QIDQ656610
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
combinatorial problemsgenomepattern avoiding permutationgenerating algorithmbinary reflected Gray codewhole duplication-random loss model
Uses Software
Cites Work
- Generating alternating permutations lexicographically
- Introduction to partially ordered patterns
- A variant of the tandem duplication-random loss model of genome rearrangement
- Counting permutations by their alternating runs
- Runs, Slides and Moments
- On the tandem duplication-random loss model of genome rearrangement
- Efficient generation of the binary reflected gray code and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item