P. Bille, A survey on tree edit distance and related problems, Theoretical Computer Science, vol.337, issue.1-3, p.217239, 2005.
DOI : 10.1016/j.tcs.2004.12.030

L. Blin, Apprentissage de structures d'arbres à partir d'exemples, Thèse, 2002.

S. Dulucq and H. Touzet, Analysis of Tree Edit Distance Algorithms, Proceedings of the 14th annual symposium on Combinatorial Pattern Matching (CPM, p.8395, 2003.
DOI : 10.1007/3-540-44888-8_7
URL : https://hal.archives-ouvertes.fr/hal-00307516

D. Guseld, Algorithms on strings, trees, and sequences, 1997.

D. Harel and R. E. Tarjan, Fast algorithms for nding nearest common ancestors, SIAM J. Comput, vol.13, issue.2, p.338355, 1984.

C. M. Homann and M. J. Donnell, Pattern Matching in Trees, Journal of the ACM, vol.29, issue.1, pp.68-95, 1982.
DOI : 10.1145/322290.322295

J. Jansson and A. Lingas, A Fast Algorithm for Optimal Alignment between Similar Ordered Trees, Fundam. Inform, vol.56, issue.12, p.105120, 2003.
DOI : 10.1007/3-540-48194-X_22

T. Jiang, L. Wang, and K. Zhang, Alignment of trees -an alternative to tree edit, CPM '94: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, p.7586, 1994.

N. Philip and . Klein, Computing the edit-distance between unrooted ordered trees, ESA, p.91102, 1998.

P. N. Klein, S. Tirthapura, D. Sharvit, and B. B. Kimia, A tree-edit-distance algorithm for comparing simple, closed shapes, SODA, p.696704, 2000.

C. Lu, Z. Su, and C. Y. Tang, A New Measure of Edit Distance between Labeled Trees, COCOON, p.338348, 2001.
DOI : 10.1007/3-540-44679-6_37

R. Ramesh and I. V. Ramakrishnan, Nonlinear pattern matching in trees, J. ACM, vol.39, issue.2, p.295316, 1992.

T. Richter, A new measure of the distance between ordered trees and its applications, technical report 85166-cs, 1997.

J. Setubal and J. Meidanis, Introduction to computational biology, 1997.

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

A. Robert, M. J. Wagner, and . Fischer, The string-to-string correction problem, J. ACM, vol.21, issue.1, p.168173, 1974.

K. Zhang, Algorithms for the constrained editing distance between ordered labeled trees and related problems, Pattern Recognition, vol.28, issue.3, p.463474, 1995.

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, p.12451262, 1989.
DOI : 10.1137/0218082

K. Zhang, D. Shasha, and J. Wang, Approximate Tree Matching in the Presence of Variable Length Don???t Cares, Journal of Algorithms, vol.16, issue.1, p.3366, 1994.
DOI : 10.1006/jagm.1994.1003