R. E. Bellman, Dynamic Programming, 1957.

S. B. Needleman and C. D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, vol.48, issue.3, pp.443-453, 1970.
DOI : 10.1016/0022-2836(70)90057-4

T. F. Smith and M. S. Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, vol.147, issue.1, pp.195-197, 1981.
DOI : 10.1016/0022-2836(81)90087-5

D. Sankoff, Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems, SIAM Journal on Applied Mathematics, vol.45, issue.5, pp.810-825, 1985.
DOI : 10.1137/0145048

M. Ferch, J. Zhang, and M. Höchsmann, Learning cooperative assembly with the graph representation of a state-action space, IEEE/RSJ International Conference on Intelligent Robots and System, 2002.
DOI : 10.1109/IRDS.2002.1041519

D. Reis, P. Golgher, A. Silva, and A. Laender, Automatic web news extraction using tree edit distance, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.17-22, 2004.
DOI : 10.1145/988672.988740
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7765

D. B. Searls, Investigating the linguistics of DNA and definite clause grammars, Proceedings of the North American Conference on Logic Programming, pp.189-208, 1989.

D. B. Searls, L. Hunter, and . Ed, The Computational Linguistics of Biological Sequences, In Artificial Intelligence and Molecular Biology, pp.47-120, 1993.

D. B. Searls, Linguistic approaches to biological sequences, Bioinformatics, vol.13, issue.4, pp.333-344, 1997.
DOI : 10.1093/bioinformatics/13.4.333

. Lefebvre, A grammar-based unification of several alignment and folding algorithms, AAAI Intell. Syst. Mol. Biol, vol.4, pp.143-154, 1996.

D. E. Knuth, Semantics of context-free languages, Mathematical Systems Theory, vol.9, issue.2, pp.127-145, 1968.
DOI : 10.1007/BF01692511

R. Giegerich, C. Meyer, and P. Steffen, A discipline of dynamic programming over sequence data, Science of Computer Programming, vol.51, issue.3, pp.215-263, 2004.
DOI : 10.1016/j.scico.2003.12.005

R. Giegerich and P. Steffen, Challenges in the compilation of a domain specific language for dynamic programming, Proceedings of the 2006 ACM symposium on Applied computing , SAC '06, pp.23-27, 2006.
DOI : 10.1145/1141277.1141653

C. Höner-zu-siederdissen, Sneaking around concatMap: efficient combinators for dynamic programming, Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, pp.10-1212, 2012.

G. Sauthoff, M. Möhl, S. Janssen, and R. Giegerich, Bellman's GAP--a language and compiler for dynamic programming in sequence analysis, Bioinformatics, vol.29, issue.5, pp.551-560, 2013.
DOI : 10.1093/bioinformatics/btt022

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

E. Ohlebusch, Advanced Topics in Term Rewriting, 2002.
DOI : 10.1007/978-1-4757-3661-8

O. Gotoh, An improved algorithm for matching biological sequences, Journal of Molecular Biology, vol.162, issue.3, pp.705-708, 1982.
DOI : 10.1016/0022-2836(82)90398-9

R. Durbin, S. R. Eddy, A. Krogh, and G. Mitchison, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, 1998.
DOI : 10.1017/CBO9780511790492

R. Giegerich, Explaining and Controlling Ambiguity in Dynamic Programming, Proceedings of the Combinatorial Pattern Matching, pp.46-59, 2000.
DOI : 10.1007/3-540-45123-4_6

R. Nussinov, G. Pieczenik, J. Griggs, and D. Kleitman, Algorithms for Loop Matchings, SIAM Journal on Applied Mathematics, vol.35, issue.1, pp.68-82, 1978.
DOI : 10.1137/0135006

J. K. Baker, Trainable grammars for speech recognition, The Journal of the Acoustical Society of America, vol.65, issue.S1, pp.54-550, 1979.
DOI : 10.1121/1.2017061

Y. Sakakibara, M. Brown, R. Hughey, I. Mian, K. Sjölander et al., Recent methods for RNA modeling using stochastic context-free grammars, Combinatorial Pattern Matching, pp.289-306, 1994.
DOI : 10.1007/3-540-58094-8_25

R. Dowell and S. Eddy, Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction, BMC Bioinformatics, vol.5, issue.1, p.71, 2004.
DOI : 10.1186/1471-2105-5-71

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

T. J. Macke, D. J. Ecker, R. R. Gutell, D. Gautheret, D. A. Case et al., RNAMotif, an RNA secondary structure definition and search algorithm, Nucleic Acids Research, vol.29, issue.22, pp.4724-4735, 2001.
DOI : 10.1093/nar/29.22.4724

J. Reeder, J. Reeder, and R. Giegerich, Locomotif: from graphical motif description to RNA motif search, Bioinformatics, vol.23, issue.13, p.392, 2007.
DOI : 10.1093/bioinformatics/btm179

S. R. Eddy and R. Durbin, RNA sequence analysis using covariance models, Nucleic Acids Research, vol.22, issue.11, pp.2079-2088, 1994.
DOI : 10.1093/nar/22.11.2079
URL : http://doi.org/10.1093/nar/22.11.2079

R. Giegerich and C. Höner-zu-siederdissen, Semantics and Ambiguity of Stochastic RNA Family Models, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.2, pp.499-516, 2011.
DOI : 10.1109/TCBB.2010.12

P. Gardner, J. Daub, J. Tate, E. Nawrocki, D. Kolbe et al., Rfam: updates to the RNA families database, Nucleic Acids Research, vol.37, issue.Database, p.136, 2009.
DOI : 10.1093/nar/gkn766

F. Rosselló and G. Valiente, An algebraic view of the relation between largest common subtrees and smallest common supertrees, Theoretical Computer Science, vol.362, issue.1-3, pp.33-53, 2006.
DOI : 10.1016/j.tcs.2006.05.031

S. Chawathe, Comparing hierarchical data in external memory, Proceedings of the 25th International Conference on Very Large Data Bases, pp.90-101, 1999.

H. Touzet, Tree edit distance with gaps, Information Processing Letters, vol.85, issue.3, pp.123-129, 2003.
DOI : 10.1016/S0020-0190(02)00369-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.6636

Z. Wang and K. Z. , Alignment between Two RNA Structures, In Mathematical Foundations of Computer Science, pp.25-29, 2001.
DOI : 10.1007/3-540-44683-4_60

R. Backofen, S. Chen, D. Hermelin, G. M. Landau, M. A. Roytberg et al., Locality and Gaps in RNA Comparison, Journal of Computational Biology, vol.14, issue.8, pp.1074-1087, 2007.
DOI : 10.1089/cmb.2007.0062

J. Jansson, N. T. Hieu, and W. K. Sung, Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs, Journal of Computational Biology, vol.13, issue.3, pp.702-718, 2006.
DOI : 10.1089/cmb.2006.13.702

S. Schirmer and R. Giegerich, Forest Alignment with Affine Gaps and Anchors, Combinatorial Pattern Matching, pp.104-117, 2011.
DOI : 10.1137/0218082

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

E. Demaine, S. Mozes, B. R. Weimann, and O. , An optimal decomposition algorithm for tree edit distance, ACM Trans. Algorithms, vol.6, 2009.

G. Sauthoff, S. Janssen, and R. Giegerich, Bellman's GAP, Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, PPDP '11, 2011.
DOI : 10.1145/2003476.2003484

D. B. Searls and K. P. Murphy, Automata-theoretic models of mutation and alignment, Proceedings of the ISMB, pp.341-349, 1995.

G. Huet and D. Lankford, On theUniform Halting Problem for Term Rewriting Systems, 1978.

W. Powell, Approximate Dynamic Programming: Solving the Curses of Dimensionality, 2007.
DOI : 10.1002/9781118029176

B. Voß, R. Giegerich, and M. Rehmsmeier, Complete probabilistic analysis of RNA shapes, BMC Biol, 2005.

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

B. Braßel, M. Hanus, B. Peemöller, and F. Reck, KiCS2: A new compiler from curry to haskell, Proceedings of the 20th International Workshop on Functional and (Constraint) Logic Programming, pp.1-18, 2011.

S. Thompson and . Haskell, The Craft of Functional Programming, 2011.

J. Eisner, N. W. Filardo, T. Dyna-furche, G. Gottlob, G. Grasso et al., Extending Datalog for modern AI Datalog 2.0, This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license, 2011.