M. Balcan and A. Blum, On a Theory of Learning with Similarity Functions, Proceedings of the 23rd International Conference on Machine Learning (ICML), pp.73-80, 2006.

M. Balcan, A. Blum, and N. Srebro, Improved Guarantees for Learning via Similarity Functions, Proceedings of the 21st Annual Conference on Learning Theory (COLT), pp.287-298, 2008.

A. Bellet, A. Habrard, and M. Sebban, Good edit similarity learning by loss minimization, Machine Learning, vol.18, issue.6, pp.5-35, 2012.
DOI : 10.1007/s10994-012-5293-8

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

M. Bernard, L. Boyer, A. Habrard, and M. Sebban, Learning probabilistic models of tree edit distance, Pattern Recognition, vol.41, issue.8, pp.2611-2629, 2008.
DOI : 10.1016/j.patcog.2008.01.011

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

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

URL : http://doi.org/10.1016/j.tcs.2004.12.030

L. Boyer, Y. Esposito, A. Habrard, J. Oncina, and M. Sebban, SEDiL: Software for Edit Distance Learning, Proceeding of the European Conference on Machine Learning and Lnowledge Discovery in Databases (ECML/PKDD), pp.672-677, 2008.
DOI : 10.1007/978-3-540-87481-2_45

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

L. Boyer, A. Habrard, and M. Sebban, Learning Metrics Between Tree Structured Data: Application to Image Recognition, Proceedings of the European Conference on Machine Learning (ECML), pp.54-66, 2007.
DOI : 10.1007/978-3-540-74958-5_9

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

N. Dalvi, P. Bohannon, and F. Sha, Robust web extraction, Proceedings of the 35th SIGMOD international conference on Management of data, SIGMOD '09, pp.335-348, 2009.
DOI : 10.1145/1559845.1559882

F. Denis, E. Gilbert, A. Habrard, F. Ouardi, and M. Tommasi, Relevant Representations for the Inference of Rational Stochastic Tree Languages, Proceedings of the 9th International Colloquium on Grammatical Inference (ICGI), pp.57-70, 2008.
DOI : 10.1007/978-3-540-88009-7_5

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

M. Emms, On stochastic tree distances and their training via expectation-maximisation, Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods -ICPRAM 2012 -Volume, pp.144-153, 2012.

A. Habrard, J. M. Iñesta, D. Rizo, and M. Sebban, Melody Recognition with Learned Edit Distances, Proceedings of the IAPR International Workshop Structural and Syntactic Pattern Recognition (SSPR), pp.86-96, 2008.
DOI : 10.1007/978-3-540-89689-0_13

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

P. R. Illescas, D. Rizo, and J. M. Iñesta, Harmonic, melodic, and functional automatic analysis, Proceedings of the International Computer Music Conference (ICMC), pp.165-168, 2007.

P. Klein, Computing the Edit-Distance Between Unrooted Ordered Trees, Proceedings of the 6th European Symposium on Algorithms (ESA), 1998.
DOI : 10.1007/3-540-68530-8_8

V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics-Doklandy, vol.6, pp.707-710, 1966.

Y. Mehdad, Automatic cost estimation for tree edit distance using particle swarm optimization, Proceedings of the ACL-IJCNLP 2009 Conference Short Papers on, ACL-IJCNLP '09, pp.289-292, 2009.
DOI : 10.3115/1667583.1667672

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

M. Neuhaus and H. Bunke, A probabilistic approach to learning costs for graph edit distance, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004., pp.389-393, 2004.
DOI : 10.1109/ICPR.2004.1334548

D. Rizo, Symbolic music comparison with tree data structures, 2010.

D. Rizo, K. Lemström, and J. M. Iñesta, Tree Representation in Combined Polyphonic Music Comparison, Proceeding of International Symposium on Computer Music Modeling and Retrieval, Genesis of Meaning in Sound and Music (CMMR), pp.177-195, 2009.
DOI : 10.1007/978-1-4757-2711-1

S. Selkow, The tree-to-tree editing problem, Information Processing Letters, vol.6, issue.6, pp.184-186, 1977.
DOI : 10.1016/0020-0190(77)90064-3

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

P. Zigoris, D. Eads, and Y. Zhang, Unsupervised Learning of Tree Alignment Models for Information Extraction, Sixth IEEE International Conference on Data Mining, Workshops (ICDMW'06), pp.45-49, 2006.
DOI : 10.1109/ICDMW.2006.166