S. Bespamyathnikh and M. Segal, Enumerating longest increasing subsequences and patience sorting, Information Processing Letters, vol.76, issue.1-2, pp.7-11, 2000.
DOI : 10.1016/S0020-0190(00)00124-1

M. Crochemore, G. M. Landau, and M. Ziv-ukelson, A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices, SIAM Journal on Computing, vol.32, issue.6, pp.1654-1673, 2003.
DOI : 10.1137/S0097539702402007

URL : https://hal.archives-ouvertes.fr/hal-00619573

A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White et al., Alignment of whole genomes, Nucleic Acids Research, vol.27, issue.11, pp.2369-2376, 1999.
DOI : 10.1093/nar/27.11.2369

M. L. Fredman, On computing the length of longest increasing subsequences, Discrete Mathematics, vol.11, issue.1, pp.29-35, 1975.
DOI : 10.1016/0012-365X(75)90103-X

Y. Han, Deterministic sorting in O(nloglogn) time and linear space, Journal of Algorithms, vol.50, issue.1, pp.96-105, 2004.
DOI : 10.1016/j.jalgor.2003.09.001

J. Hunt and T. Szymanski, A fast algorithm for computing longest common subsequences, Communications of the ACM, vol.20, issue.5, pp.350-353, 1977.
DOI : 10.1145/359581.359603

D. Liben-nowell, E. Vee, and A. Zhu, Finding longest increasing and common subsequences in streaming data, Journal of Combinatorial Optimization, vol.19, issue.11, pp.155-175, 2006.
DOI : 10.1007/s10878-006-7125-x

M. Lothaire, Algebraic Combinatorics on Words Number 90 in Encyclopedia of Mathematics and its Applications, 2002.

W. Masek and M. Paterson, A faster algorithm computing string edit distances, Journal of Computer and System Sciences, vol.20, issue.1, pp.18-31, 1980.
DOI : 10.1016/0022-0000(80)90002-1

S. Muthukrishnan, Data Streams: Algorithms and Applications, volume 1 of Foundations and Trends in Theoretical Computer Science, 2005.

A. M. Odlyzko and E. M. Rains, On longest increasing subsequences in random permutations, 1999.
DOI : 10.1090/conm/251/03886

C. Schensted, Longest increasing and decreasing subsequences, Journal canadien de math??matiques, vol.13, issue.0, pp.179-191, 1961.
DOI : 10.4153/CJM-1961-015-3

J. M. Steele, Variations on the monotone subsequence theme of ErdösErd¨Erdös and Szekeres of The IMA volumes in mathematics and its applications, Discrete Probability and Algorithms, pp.111-131, 1995.

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.80-82, 1977.
DOI : 10.1016/0020-0190(77)90031-X

P. Van-emde-boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Mathematical Systems Theory, vol.22, issue.1, pp.99-127, 1977.
DOI : 10.1007/BF01683268

I. Yang, C. Huang, and K. Chao, A fast algorithm for computing a longest common increasing subsequence, Information Processing Letters, vol.93, issue.5, pp.249-253, 2005.
DOI : 10.1016/j.ipl.2004.10.014