M. Adelsonvelskii and E. M. Landis, An algorithm for the organization of information, Defense Technical Information Center, 1963.

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

A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6
DOI : 10.1145/360825.360855

A. Andersson and M. Thorup, Dynamic ordered sets with exponential search trees, Journal of the ACM, vol.54, issue.3
DOI : 10.1145/1236457.1236460

R. Bayer, Symmetric binary B-Trees: Data structure and maintenance algorithms, Acta Informatica, vol.1, issue.4
DOI : 10.1007/BF00289509

D. Belazzougui, A. Pierrot, M. Raffinot, and S. Vialette, Single and multiple consecutive permutation motif search. CoRR, abs/1301, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00859363

P. Bose, J. F. Buss, and A. Lubiw, Pattern matching for permutations, Information Processing Letters, vol.5, issue.5 2, 0283.

Y. Han, ) time and linear space, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.602-608, 2002.
DOI : 10.1145/509907.509993

J. J. Morris and V. R. Pratt, A linear pattern-matching algorithm, 1970.

S. Kitaev, Patterns in Permutations and Words, EATCS, 2011.

M. Kubica, J. Kulczy´nskikulczy´nski, W. Radoszewski, T. Rytter, and . Wale´nwale´n, A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters, vol.113, issue.12, 2013.
DOI : 10.1016/j.ipl.2013.03.015

G. Navarro and K. Fredriksson, Average complexity of exact and approximate multiple string matching, Theoretical Computer Science, vol.321, issue.2-3
DOI : 10.1016/j.tcs.2004.03.058

I. Simon, String matching algorithms and automata, Theoretical Computer Science, number 814 in LNCS, pp.386-395, 1994.
DOI : 10.1007/3-540-58131-6_61

P. Van-emde and . Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, vol.6, issue.3, pp.0-8
DOI : 10.1016/0020-0190(77)90031-X

D. E. Willard, Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree, SIAM Journal on Computing, vol.29, issue.3, p.9, 1999.
DOI : 10.1137/S0097539797322425

A. C. Yao, The Complexity of Pattern Matching for a Random String, SIAM Journal on Computing, vol.8, issue.3
DOI : 10.1137/0208029