F. Bernhart and B. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, Series B, vol.27, issue.3, pp.320-331, 1979.
DOI : 10.1016/0095-8956(79)90021-2

T. C. Biedl, G. Kant, and M. Kaufmann, On Triangulating Planar Graphs under the Four-Connectivity Constraint, Algorithmica, vol.19, issue.4, pp.427-446, 1997.
DOI : 10.1007/PL00009182

M. Crochemore, D. Hermelin, G. M. Landau, and S. Vialette, Approximating the 2-interval pattern problem, ESA'05, pp.426-437, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00619979

S. Dulucq and H. Touzet, Decomposition algorithms for the tree edit distance problem, Journal of Discrete Algorithms, vol.3, issue.2-4, pp.448-471, 2005.
DOI : 10.1016/j.jda.2004.08.018
URL : https://hal.archives-ouvertes.fr/hal-00307523

P. Evans, Algorithms and Complexity for Annotated Sequences Analysis, 1999.

C. Herrbach, A. Denise, S. Dulucq, and H. Touzet, A polynomial algorithm for comparing RNA secondary structures using a full set of operations

T. Jiang, G. Lin, B. Ma, and K. Zhang, A General Edit Distance between RNA Structures, Journal of Computational Biology, vol.9, issue.2, pp.371-388, 2002.
DOI : 10.1089/10665270252935511
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.5161

T. Jiang, G. Lin, B. Ma, and K. Zhang, The longest common subsequence problem for arc-annotated sequences, Journal of Dicrete Algorithms, pp.257-270, 2004.

T. Jiang, L. Wang, and K. Zhang, Alignment of trees ??? an alternative to tree edit, Theoretical Computer Science, vol.143, issue.1, pp.137-148, 1995.
DOI : 10.1016/0304-3975(95)80029-9

P. Klein, Computing the Edit-Distance Between Unrooted Ordered Trees, 6th European Symposium on Algorithms, pp.91-102, 1998.
DOI : 10.1007/3-540-68530-8_8

G. Lin, Z. Chen, T. Jiang, and J. Wen, The longest common subsequence problem for sequences with nested arc annotations, Journal of Computer and System Sciences, vol.65, issue.3, pp.465-480, 2002.
DOI : 10.1016/S0022-0000(02)00004-1

G. Lin, B. Ma, and K. Zhang, Edit distance between two RNA structures, Proceedings of the fifth annual international conference on Computational biology , RECOMB '01, pp.211-220, 2001.
DOI : 10.1145/369133.369214
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7919

B. Ma, L. Wang, and K. Zhang, Computing similarity between RNA structures, Theoretical Computer Science, vol.276, issue.1-2, pp.111-132, 2002.
DOI : 10.1016/S0304-3975(01)00192-X
URL : http://doi.org/10.1016/s0304-3975(01)00192-x

K. C. Tai, The Tree-to-Tree Correction Problem, Journal of the ACM, vol.26, issue.3, pp.422-433, 1979.
DOI : 10.1145/322139.322143

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

K. Zhang and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing, vol.18, issue.6, pp.1245-1262, 1989.
DOI : 10.1137/0218082