M. H. Albert and M. D. Atkinson, Simple permutations and pattern restricted permutations, Discrete Mathematics, vol.300, issue.1-3, pp.1-15, 2005.
DOI : 10.1016/j.disc.2005.06.016
URL : http://doi.org/10.1016/j.disc.2005.06.016

M. H. Albert, M. D. Atkinson, and M. Klazar, The enumeration of simple permutations, J. Integer Seq, vol.6, pp.3-4, 2003.

S. Bérard, A. Bergeron, C. Chauve, and C. Paul, Perfect Sorting by Reversals Is Not Always Difficult, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.1, pp.4-16, 2007.
DOI : 10.1109/TCBB.2007.1011

A. Bergeron, C. Chauve, F. De-montgolfier, and M. Raffinot, Permutations, with Applications to Modular Decomposition of Graphs, Proc. 13th Annual European Symposium on Algorithms, pp.779-790, 2005.
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

M. Bouvel, C. Chauve, M. Mishna, and D. Rossin, Average-case analysis of perfect sorting by reversals. Discrete Math, Algorithms Appl, vol.3, issue.3, pp.369-392, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00964118

M. Bouvel, M. Mishna, and C. Nicaud, Some simple varieties of trees arising in permutation analysis. Full version in preparation
URL : https://hal.archives-ouvertes.fr/hal-01229665

G. Chapuy, A. Pierrot, and D. Rossin, On growth rate of wreath-closed permutation classes. Talk at the conference Permutation Patterns, 2011.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001