Formulae and asymptotics for coefficients of algebraic functions, Combin. Probab. Comput, vol.24, issue.1, pp.1-53, 2015. ,
On the period mod m of polynomially-recursive sequences: a case study, preparation, 2018. ,
Danì ele Gardy, and Dominique Gouyou-Beauchamps. Generating functions for generating trees, Discrete Math, vol.246, issue.1-3, pp.29-55, 1999. ,
ECO: a methodology for the enumeration of combinatorial objects, J. Differ. Equations Appl, vol.5, issue.4-5, pp.435-490, 1999. ,
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
Whole mirror duplication-random loss model and pattern avoiding permutations, Inform. Process. Lett, vol.110, issue.11, pp.474-480, 2010. ,
DOI : 10.1016/j.ipl.2010.04.016
URL : https://hal.archives-ouvertes.fr/hal-00785281
, Combinatorics of permutations. Discrete Mathematics and its Applications, 2012.
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
Posets and permutations in the duplication-loss model: minimal permutations with d descents, Theoret. Comput. Sci, vol.411, pp.2487-2501, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00286561
A variant of the tandem duplication-random loss model of genome rearrangement, Theoret. Comput. Sci, pp.847-858, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00206178
Théorèmes d'algébricité en géométrie diophantienne (d'après, Astérisque, pp.175-209, 2002. ,
On the tandem duplication-random loss model of genome rearrangement, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.564-570, 2006. ,
Congruences for Catalan and Motzkin numbers and related sequences, J. Number Theory, vol.117, issue.1, pp.191-215, 2006. ,
DOI : 10.1016/j.jnt.2005.06.005
URL : https://doi.org/10.1016/j.jnt.2005.06.005
The chromosome inversion problem, Journal of Theoretical Biology, vol.99, issue.82, pp.90384-90392, 1982. ,
Analytic combinatorics, 2009. ,
DOI : 10.1017/cbo9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739
An Introduction to Bioinformatics Algorithms, 2004. ,
A method for determining the mod-2 k behaviour of recursive sequences, with applications to subgroup counting, Electron. J. Combin, vol.18, issue.2, p.83, 2011. ,
Patterns in permutations and words, Monographs in Theoretical Computer Science. An EATCS Series, 2011. ,
DOI : 10.1007/978-3-642-17333-2
The art of computer programming, vol.3, 1998. ,
, , 2013.
Minimal permutations with d descents, European J. Combin, vol.31, issue.5, pp.1445-1460, 2010. ,
Introduction to Computational Molecular Biology, 1997. ,
A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences, J. Difference Equ. Appl, vol.20, issue.7, pp.973-988, 2014. ,
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. ,
URL : https://hal.archives-ouvertes.fr/inria-00070025
Sloane and collaborators. On-Line Encyclopedia of Integer Sequences, 2016. ,
, Cambridge Studies in Advanced Mathematics, vol.1, 2012.
A short approach to Catalan numbers modulo 2 r, Electron. J. Combin, vol.18, issue.1, p.12, 2011. ,