SCIENCE@home

Posets and permutations in the duplication-loss model: Minimal permutations with d descents

M. Bouvel,E. Pergola

Published 2008 in Theoretical Computer Science

ABSTRACT

In this paper, we are interested in the combinatorial analysis of the whole genome duplication-random loss model of genome rearrangement initiated in Chaudhuri et al. (2006) [9] and Bouvel and Rossin (2009) [8]. In this model, genomes composed of n genes are modeled by permutations of the set of integers {1,2,...,n}, that can evolve through duplication-loss steps. It was previously shown that the class of permutations obtained in this model after a given number p of steps is a class of pattern-avoiding permutations of finite basis. The excluded patterns were described as the minimal permutations with d=2^p descents, minimal being intended in the sense of the pattern-involvement relation on permutations. Here, we give a local and simpler characterization of the set B"d of minimal permutations with d descents. We also provide a more detailed analysis-characterization, bijection and enumeration-of two particular subsets of B"d, namely the patterns in B"d of size d+2 and 2d.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-18 of 18 references · Page 1 of 1

CITED BY

Showing 1-19 of 19 citing papers · Page 1 of 1