N. Alon, Private communication, 2006.

L. Alonso and R. Schott, On the tree inclusion problem, Proc. 18th Mathematical Foundations of Computer Science (MFCS), pp.211-221, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00000272

A. Apostolico and C. Guerra, The longest common subsequence problem revisited, Algorithmica, vol.21, issue.1-4, pp.315-336, 1987.
DOI : 10.1007/BF01840365

G. Blin, G. Fertin, R. Rizzi, and S. Vialette, What makes the arc-preserving subsequence problem hard ?, Proc. 5th International Conference on Computational Science (ICCS), pp.860-868, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00417738

G. Blin, G. Fertin, and S. Vialette, New Results for the 2-Interval Pattern Problem, Proc. 15th Combinatorial Pattern Matching (CPM), 2004.
DOI : 10.1007/978-3-540-27801-6_23
URL : https://hal.archives-ouvertes.fr/hal-00620366

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. Chang and F. Wang, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Information Processing Letters, vol.43, issue.6, pp.293-295, 1992.
DOI : 10.1016/0020-0190(92)90114-B

W. Chen, More Efficient Algorithm for Ordered Tree Inclusion, Journal of Algorithms, vol.26, issue.2, pp.370-385, 1998.
DOI : 10.1006/jagm.1997.0899

M. Crochemore, D. Hermelin, G. M. Landau, and S. Vialette, Approximating the 2-interval pattern problem, Proc. 13th European Symposium on Algorithms (ESA), pp.426-437, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00619979

E. Davydov and S. Batzoglou, A computational model for RNA multiple structural alignment, Proc. 15th Combinatorial Pattern Matching (CPM), pp.254-269, 2004.

R. P. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics Series, vol.2, issue.51, pp.161-166, 1950.
DOI : 10.2307/1969503

D. Eppstein, Z. Galil, R. Giancarlo, and G. F. Italiano, Sparse dynamic programming I: linear cost functions, Journal of the ACM, vol.39, issue.3, pp.519-545, 1992.
DOI : 10.1145/146637.146650

P. Erd?-os and G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica, vol.2, pp.463-470, 1935.

P. A. Evans, Algorithms and complexity for annotated sequence analysis, 1999.

D. Goldman, S. Istrail, and C. H. Papadimitriou, Algorithmic aspects of protein structure similarity, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.512-522, 1999.
DOI : 10.1109/SFFCS.1999.814624

J. Gramm, A polynomial-time algorithm for the matching of crossing contact-map patterns, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.1, issue.4, pp.171-180, 2004.
DOI : 10.1109/TCBB.2004.35

J. Gramm, J. Guo, and R. Niedermeier, Pattern matching for arc-annotated sequences, Proc. 22nd Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.182-193, 2002.

U. I. Gupta, D. T. Lee, and J. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks, vol.9, issue.4, pp.459-467, 1982.
DOI : 10.1002/net.3230120410

D. S. Hirschberg, Algorithms for the Longest Common Subsequence Problem, Journal of the ACM, vol.24, issue.4, pp.664-675, 1977.
DOI : 10.1145/322033.322044

J. W. Hunt and T. G. 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

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

P. N. Klein, Computing the Edit-Distance Between Unrooted Ordered Trees, Proc. 6th European Symposium on Algorithms (ESA), volume 1461 of LNCS, pp.91-102, 1998.
DOI : 10.1007/3-540-68530-8_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.5624

A. Kostochka, On upper bounds on the chromatic numbers of graphs, Transactions of the Institute of Mathematics (Siberian Branch of the Academy of Sciences in USSR), vol.10, pp.204-226, 1988.

A. Kostochka and J. Kratochvil, Covering and coloring polygon-circle graphs, Discrete Mathematics, vol.163, issue.1-3, pp.299-305, 1997.
DOI : 10.1016/S0012-365X(96)00344-5
URL : http://doi.org/10.1016/s0012-365x(96)00344-5

M. Kubica, R. Rizzi, S. Vialette, and T. Wale´nwale´n, Approximation of RNA multiple structural alignment, Proc. 17th Combinatorial Pattern Matching (CPM), pp.211-222, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00620291

S. C. Li and M. Li, On the Complexity of the Crossing Contact Map Pattern Matching Problem, Proc. 6th Workshop on Algorithms in Bioinformatics (WABI), pp.231-241, 2006.
DOI : 10.1007/11851561_22

D. Maier, The Complexity of Some Problems on Subsequences and Supersequences, Journal of the ACM, vol.25, issue.2, pp.322-336, 1978.
DOI : 10.1145/322063.322075

W. J. Masek and M. S. 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

D. Shasha and K. Zhang, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comp, vol.18, issue.6, pp.1245-1262, 1989.

A. Tiskin, Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs, Proc. 17th Combinatorial Pattern Matching (CPM), pp.270-281, 2006.
DOI : 10.1007/11780441_25

S. Vialette, On the computational complexity of 2-interval pattern matching problems, Theoretical Computer Science, vol.312, issue.2-3, pp.223-249, 2004.
DOI : 10.1016/j.tcs.2003.08.010