J. Alber, J. Gramm, J. Guo, and R. Niedermeier, Computing the similarity of two sequences with nested arc annotations, Theoretical Computer Science, vol.312, issue.2-3, pp.337-358, 2004.
DOI : 10.1016/j.tcs.2003.10.026

G. Blin, M. Crochemore, and S. Vialette, Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, chapter Algorithmic Aspects of Arc-Annotated Sequences, 2010.

G. Blin, A. Denise, S. Dulucq, C. Herrbach, and H. Touzet, Alignments of RNA Structures, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, issue.2, 2008.
DOI : 10.1109/TCBB.2008.28

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

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

P. A. Evans, Finding Common Subsequences with Arcs and Pseudoknots, Proc. CPM 99, pp.270-280, 1999.
DOI : 10.1007/3-540-48452-3_20

M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, 1979.

V. Guignon, C. Chauve, and S. Hamel, An Edit Distance Between RNA Stem-Loops, Proc. of SPIRE 2005, pp.335-347, 2005.
DOI : 10.1007/11575832_38

S. Hamel, G. Blin, and S. Vialette, Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions, Proc. of WALCOM'10, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00620327

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

T. Jiang, G. Lin, B. Ma, and K. Zhang, The longest common subsequence problem for arc-annotated sequences, Proc. CPM, pp.154-165, 2000.

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

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