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, 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

G. Blin, G. Fertin, G. Herry, and S. Vialette, Comparing RNA Structures: Towards an Intermediate Model Between the Edit and the Lapcs Problems, 1st Brazilian Symposium on Bioinformatics, pp.101-112, 2007.
DOI : 10.1007/978-3-540-73731-5_10

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

G. Blin, G. Fertin, I. Rusu, and C. Sinoquet, Extending the hardness of rna secondary structu, 1st intErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental methodologies, pp.140-151, 2007.

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

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

J. Gramm, J. Guo, and R. Niedermeier, Pattern matching for arc-annotated sequences, ACM Transactions on Algorithms, vol.2, issue.1, pp.44-65, 2006.
DOI : 10.1145/1125994.1125997

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.3444

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, Journal of Dicrete Algorithms, pp.257-270, 2004.

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

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