S. Ahal and Y. Rabinovich, On Complexity of the Subpattern Problem, SIAM Journal on Discrete Mathematics, vol.22, issue.2, pp.629-649, 2008.
DOI : 10.1137/S0895480104444776

M. H. Albert, R. E. Aldred, M. D. Atkinson, and D. A. Holton, Algorithms for Pattern Involvement in Permutations, Proc. International Symposium on Algorithms and Computation (ISAAC), pp.355-366, 2001.
DOI : 10.1016/S0012-365X(96)83023-8
URL : http://www.cs.otago.ac.nz/staffpriv/mike/Papers/Recognition/Recognition.pdf

D. Avis and M. Newborn, On pop-stacks in series, Utilitas Mathematica, vol.19, pp.129-140, 1981.

P. Bille and I. L. Gørtz, The tree inclusion problem, ACM Transactions on Algorithms, vol.7, issue.3, p.38, 2011.
DOI : 10.1145/1978782.1978793

P. Bose, J. F. Buss, and A. Lubiw, Pattern matching for permutations, Information Processing Letters, vol.65, issue.5, pp.277-283, 1998.
DOI : 10.1016/S0020-0190(97)00209-3

M. Bouvel, D. Rossin, and S. Vialette, Longest Common Separable Pattern Among Permutations, Proc. Symposium on Combinatorial Pattern Matching (CPM), pp.316-327, 2007.
DOI : 10.1007/978-3-540-73437-6_32

M. Bruner and M. Lackner, A fast algorithm for permutation pattern matching based on alternating runs, 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp.2012-261
DOI : 10.1007/978-3-642-31155-0_23
URL : http://arxiv.org/pdf/1204.5224

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, 2009.

S. Giraudo and S. Vialette, Unshuffling Permutations, 12th Latin American Theoretical Informatics Symposium (LATIN), pp.509-521, 2016.
DOI : 10.1007/978-3-662-49529-2_38
URL : https://hal.archives-ouvertes.fr/hal-01260549

S. Guillemot and D. Marx, Finding small patterns in permutations in linear time, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) SIAM, pp.82-101, 2014.
DOI : 10.1137/1.9781611973402.7
URL : http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.7

L. Ibarra, Finding pattern matchings for permutations, Information Processing Letters, vol.61, issue.6, pp.293-295, 1997.
DOI : 10.1016/S0020-0190(97)00029-X

P. Kilpeläinen and H. Manilla, Ordered and Unordered Tree Inclusion, SIAM Journal on Computing, vol.24, issue.2, pp.340-356, 1995.
DOI : 10.1137/S0097539791218202

D. Rossin and M. Bouvel, The longest common pattern problem for two permutations, Pure Mathematics and Applications, vol.17, pp.55-69, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00115598

V. Vatter, Permutation classes, Handbook of Enumerative Combinatorics, Chapman and Hall/CRC, pp.753-818, 2015.