C. Banderier and M. Drmota, Formulae and Asymptotics for Coefficients of Algebraic Functions, Combinatorics, Probability and Computing, vol.61, issue.01, pp.1-53, 2015.
DOI : 10.1007/s00222-011-0337-4

C. Banderier, M. Bousquet-mélou, A. Denise, P. Flajolet, D. Danì-ele-gardy et al., Generating functions for generating trees, Discrete Mathematics, vol.246, issue.1-3, pp.29-55, 1999.
DOI : 10.1016/S0012-365X(01)00250-3
URL : https://hal.archives-ouvertes.fr/hal-00003258

C. Banderier, J. Baril, and C. Santos, P-recursive sequences, D-finite functions , supercongruences and mod-k periodicity, p.2017

E. Barcucci, A. D. Lungo, E. Pergola, and R. Pinzani, ECO:a methodology for the enumeration of combinatorial objects, Journal of Difference Equations and Applications, vol.132, issue.3, pp.435-490, 1999.
DOI : 10.1016/0012-365X(94)00067-1

J. Baril, Gray code for permutations with a fixed number of left-to-right minima, Ars Combin, vol.111, pp.225-239, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00832409

J. Baril and R. Vernay, Whole mirror duplication-random loss model and pattern avoiding permutations, Information Processing Letters, vol.110, issue.11, pp.474-480, 2010.
DOI : 10.1016/j.ipl.2010.04.016
URL : https://hal.archives-ouvertes.fr/hal-00785281

M. Bóna, Combinatorics of permutations. Discrete Mathematics and its Applications

M. Bouvel and L. Ferrari, On the enumeration of d-minimal permutations, Discrete Math. Theor. Comput. Sci, vol.15, issue.2, pp.33-48, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00530158

M. Bouvel and E. Pergola, Posets and permutations in the duplication-loss model: minimal permutations with d descents, Theoret. Comput. Sci, vol.411, pp.26-282487, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00286561

M. Bouvel and D. Rossin, A variant of the tandem duplication ??? random loss model of genome rearrangement, Theoretical Computer Science, vol.410, issue.8-10, pp.8-10847, 2009.
DOI : 10.1016/j.tcs.2008.11.017
URL : https://hal.archives-ouvertes.fr/hal-00206178

A. Chambert-loir, Théorèmes d'algébricité en géométrie diophantienne (d'après Astérisque, pp.175-209, 2002.

K. Chaudhuri, K. Chen, R. Mihaescu, and S. Rao, On the tandem duplication-random loss model of genome rearrangement, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.564-570, 2006.
DOI : 10.1145/1109557.1109619

E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, Journal of Number Theory, vol.117, issue.1, pp.191-215, 2006.
DOI : 10.1016/j.jnt.2005.06.005
URL : http://doi.org/10.1016/j.jnt.2005.06.005

W. J. Ewens, G. A. Watterson, T. E. Hall, and A. Morgan, The chromosome inversion problem, Journal of Theoretical Biology, vol.9982, pp.1-7, 1982.

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

C. Neil, P. A. Jones, and . Pevzner, An Introduction to Bioinformatics Algorithms, 2004.

M. Kauers, C. Krattenthaler, and T. W. Müller, A method for determining the mod-2 k behaviour of recursive sequences, with applications to subgroup counting, Electron. J. Combin, vol.18, issue.2, pp.37-83, 2011.

S. Kitaev, Patterns in permutations and words. Monographs in Theoretical Computer Science . An EATCS Series, 2011.
DOI : 10.1007/978-3-642-17333-2

E. Donald and . Knuth, The art of computer programming Sorting and searching, 1998.

H. Magnússon, Sorting Operators and Their Preimages. Thesis, 2013.

T. Mansour and S. H. Yan, Minimal permutations with <mml:math altimg="si10.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>d</mml:mi></mml:math> descents, European Journal of Combinatorics, vol.31, issue.5, pp.1445-1460, 2010.
DOI : 10.1016/j.ejc.2010.01.001

C. Meidanis and J. C. Setubal, Introduction to Computational Molecular Biology, 1997.

E. Rowland and D. Zeilberger, A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences, Journal of Difference Equations and Applications, vol.18, issue.2, pp.973-988, 2014.
DOI : 10.1016/j.jcta.2013.08.002

B. Salvy and P. Zimmermann, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Transactions on Mathematical Software, vol.20, issue.2, pp.163-177, 1994.
DOI : 10.1145/178365.178368
URL : https://hal.archives-ouvertes.fr/hal-00917741

J. A. Neil, Sloane and collaborators. On-Line Encyclopedia of Integer Sequences. Published electronically at https://oeis, 2016.

R. P. Stanley, Enumerative combinatorics, Cambridge Studies in Advanced Mathematics, vol.1, issue.49, 2012.

G. Xin and J. Xu, A short approach to Catalan numbers modulo 2 r, Electron. J. Combin, vol.18, issue.177, p.12, 2011.