G. Bouchard and B. Triggs, The trade-off between generative and discriminative classifiers, In: COMPSTAT, 2004.

M. Mongeau and D. Sankoff, Comparison of musical sequences, Computers and the Humanities, vol.15, issue.3, pp.161-175, 1990.
DOI : 10.1007/BF00117340

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

C. Gómez, S. Abad-mota, and E. Ruckhaus, An Analysis of the Mongeau-Sankoff Algorithm for Music Information Retrieval, Proc. of the 8th International Conference on Music Information Retrieval (ISMIR), pp.109-110, 2007.

M. Grachten, J. Arcos, and R. López-de-mántaras, Melody Retrieval using the Implication/Realization Model, Proceedings of the 6th International Conference on Music Information Retrieval (ISMIR05), 2005.

N. Rotstan and K. Meffert, JGAP: Java Genetic Algorithms Package Available: http://www.jgap.sf.net. Accessed, 2008.

S. Doraisamy and M. Rüger, Robust Polyphonic Music Retrieval with N-grams, Journal of Intelligent Information Systems, vol.21, issue.1, pp.53-70, 2003.
DOI : 10.1023/A:1023553801115

D. Rizo, F. Moreno-seco, and J. M. Iñesta, Tree-Structured Representation of Musical Information, LNCS -LNAI, vol.2652, pp.838-846, 2003.
DOI : 10.1007/978-3-540-44871-6_97

P. R. Illescas, D. Rizo, and J. M. Iñesta, Harmonic, melodic, and functional automatic analysis, Proc. International Computer Music Conference, pp.165-168, 2007.

G. Aloupis, T. Fevens, S. Langerman, T. Matsui, A. Mesa et al., Algorithms for Computing Geometric Measures of Melodic Similarity, Computer Music Journal, vol.11, issue.3, pp.67-76, 2006.
DOI : 10.1016/0020-0190(78)90083-2

M. Bernard, A. Habrard, and M. Sebban, Learning Stochastic Tree Edit Distance, Proc. of ECML'06, pp.42-53, 2006.
DOI : 10.1007/11871842_9

URL : https://hal.archives-ouvertes.fr/ujm-00109696

M. Bernard, J. Janodet, and M. Sebban, A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer, Proc. of ICGI'06, pp.240-252, 2006.
DOI : 10.1007/11872436_20

URL : https://hal.archives-ouvertes.fr/ujm-00109698

A. Dempster, M. Laird, and D. Rubin, Maximum likelihood from incomplete data via the EM algorithm, J. R. Stat. Soc, B, issue.39, pp.1-38, 1977.

R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological sequence analysis, 1998.
DOI : 10.1017/CBO9780511790492

L. Boyer, A. Habrard, and M. Sebban, Learning Metrics Between Tree Structured Data: Application to Image Recognition, Proc. of ECML'2007, pp.54-66, 2007.
DOI : 10.1007/978-3-540-74958-5_9

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

A. Mccallum, K. Bellare, and P. Pereira, A conditional random field for disciminatively-trained finite-state string edit distance, Proc. of UAI'2005, pp.388-400, 2005.

J. Oncina and M. Sebban, Learning stochastic edit distance: Application in handwritten character recognition, Pattern Recognition, vol.39, issue.9, pp.1575-1587, 2006.
DOI : 10.1016/j.patcog.2006.03.011

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

S. V. Ristad and P. N. Yianilos, Learning string-edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.20, issue.5, pp.522-532, 1998.
DOI : 10.1109/34.682181

URL : http://arxiv.org/abs/cmp-lg/9610005

S. M. 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