. Production and . Gaüzère, Villemin : Relevant cycle hypergraph representation for molecules, éditeurs : Graph- Based Representations in Pattern Recognition, de Lecture Notes in Computer Science, pp.111-120

. Conte, A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition, Lecture Notes in Computer Science, vol.7877, pp.81-90
DOI : 10.1007/978-3-642-38221-5_9
URL : https://hal.archives-ouvertes.fr/hal-00829226

. Gaüzère, Noyau de treelets appliqué aux graphes étiquetés et aux graphes de cycles. Revue d'Intelligence Artificielle, pp.121-144, 2013.

. Gaüzère, Two new graphs kernels in chemoinformatics, Pattern Recognition Letters, vol.33, issue.15, pp.2038-2047, 2012.
DOI : 10.1016/j.patrec.2012.03.020

. Gaüzère, Brun : Graph kernels based on relevant patterns and cycle information for chemoinformatics, Proceedings of ICPR 2012, pp.1775-1778, 2012.

. Bougleux, Shape similarity based on combinatorial maps and a tree pattern kernel, Proceedings of ICPR 2012, pp.1602-1605, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00768662

. Gaüzère, Villemin : Graph kernels : Crossing information from different patterns using graph edit distance, éditeurs : Structural, Syntactic, and Statistical Pattern Recognition de Lecture Notes in Computer Science, pp.42-50, 2012.

. Gaüzère, Implicit and explicit graph embedding : Comparison of both approaches on chemoinformatics applications, éditeurs : Structural, Syntactic, and Statistical Pattern Recognition de Lecture Notes in Computer Science, pp.510-518, 2012.

. Brun, Fourey : Relationships between Graph Edit Distance and Maximal Common Unlabeled Subgraph. Rapport technique, Groupe de Recherche en Informatique, 2012.

. Gaüzère, Noyau de Treelets Appliqué aux Graphes Étiquetés, Actes de la conférence RFIA 2012, pp.978-980

. Gaüzère, Villemin : Deux nouveaux noyaux sur graphes et leurs applications en chimioinformatique, Atelier AGS : Apprentissage et Graphe pour les Systèmes Complexes, 2011.

. Gaüzère, Villemin : Two new graph kernels and applications to chemoinformatics, éditeurs : 8th IAPR -TC- 15 Workshop on Graph-based Representations in Pattern Recognition (GBR'11), volume 6658 de Lecture Notes in Computer Science, pp.112-121, 2011.

A. Bibliographie, . Et-kann-98-]-e, V. Amaldi, and . Kannberg, Aronszajn : Theory of reproducing kernels. Transactions of the Harmonic Analysis on Semigroups : Theory of Positive Definite and Related Functions Applied Mathematical Sciences [Berge 76] C. Berge : Graphs and hypergraphs Kriegel : Shortest-Path kernels on graphs Vapnik : A training algorithm for optimal margin classifiers Shape similarity based on a treelet kernel with edition, éditeurs : Structural, Syntactic, of alkanes Chung : Spectral graph theory, Theoretical Computer ScienceBorgwardt et Kriegel 05] K. Borgwardt, H Fifth IEEE International Conference on Data Mining (ICDM'05) Proceedings of the fifth annual workshop on Computational learning theoryCortes et Vapnik 95] C. Cortes, V. Vapnik : Support-vector networks. Machine LearningDeo et al. 82] N. Deo, G. Prabhu, M. S. Krishnamoorthy : Algorithms for generating fundamental cycles in a graph. ACM Transactions on Mathematical Software (TOMS), pp.237-260337, 1950.

M. Deshpande, M. Kuramochi, and G. Karypisdimasi, The price of innovation : new estimates of drug development costs Review of ring perception algorithms for chemical graphs Vapnik : Support vector regression machines Advances in neural information processing systems, Proceedings of the Third IEEE International Conference on Data Mining, ICDM '03, pp.35-151, 1989.

. Durant, Nourse : Reoptimization of mdl keys for use in drug discovery, Journal of Chemical Information and Computer Sciences, pp.1273-1280, 2002.

. Faulon, The Signature Molecular Descriptor. 1. Using Extended Valence Sequences in QSAR and QSPR Studies, Journal of Chemical Information and Computer Sciences, vol.43, issue.3, pp.707-727, 2003.
DOI : 10.1021/ci020345w

J. L. Faulon, M. Collins, and R. D. Carr, The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences, Journal of Chemical Information and Computer Sciences, vol.44, issue.2
DOI : 10.1021/ci0341823

M. A. Fligner, J. S. Verducci, and P. E. , Blower : A modification of the jaccard?tanimoto similarity index for diverse selection of chemical compounds using binary strings Flower : On the properties of bit string-based measures of chemical similarity, Technometrics Journal of Chemical Information and Computer Sciences, vol.44, issue.383, pp.110-119379, 1998.

R. W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, vol.5, issue.6, pp.345-1962
DOI : 10.1145/367766.368168

H. Fröhlich, J. K. Wegner, F. Sieker, and A. , Zell : Optimal assignment kernels for attributed molecular graphs, Proceedings of the 22nd international conference on Machine learning -ICML '05, pp.225-232, 2005.

. Gärtner, On Graph Kernels: Hardness Results and Efficient Alternatives, Proceedings of the 16th An[Guyon et Elisseeff 03
DOI : 10.1007/978-3-540-45167-9_11

I. Guyon and A. Elisseeffhanser, Haasdonk : Feature space interpretation of SVMs with indefinite kernels. Pattern Analysis and Machine Intelligence A new algorithm for exhaustive ring perception in a molecular graph Raphael : A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics The influence of feature selection methods on accuracy, stability and interpretability of molecular signatures [Hocking 76] R. Hocking : A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression Ridge regression : Biased estimation for nonorthogonal problems Horton : A polynomial-time algorithm to find the shortest cycle basis of a graph, The Journal of Machine Learning Researche28210, 2011. [Haussler 99] D. Haussler : Convolution kernels on discrete structures. Rapport techniqueHorváth 05] T. Horváth : Cyclic pattern kernels revisited éditeur : Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.1157-1182482, 1968.

T. Gärtner and S. Wrobel, Cyclic pattern kernels for predictive graph mining, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining -KDD '04, p.158, 2004.

Y. Ihlenfeldt, H. Takahashi, S. Abe, and . Sasaki, Computation and management of chemical properties in CACTVS: An extensible networked approach toward modularity and compatibility, Journal of Chemical Information and Modeling, vol.34, issue.1, pp.109-116, 1994.
DOI : 10.1021/ci00017a013

D. James and J. Weininger, Delany : Daylight theory manual. website, 2004.

S. Jouili and S. Tabbone, Graph Embedding Using Constant Shift Embedding, Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos, ICPR'10, pp.83-92, 2010.
DOI : 10.1007/978-3-642-17711-8_9
URL : https://hal.archives-ouvertes.fr/inria-00526993

. Kashima, Inokuchi : Marginalized Kernels Between Labeled Graphs, Machine Learning, 2003.

I. Koch, Enumerating all connected maximal common subgraphs in two graphs, Theoretical Computer Science, vol.250, issue.1-2, pp.1-30, 2001.
DOI : 10.1016/S0304-3975(00)00286-3

N. Kriege and P. , Mutzel : Subgraph matching kernels for attributed graphs, éditeurs : Proceedings of the 29th International Conference on Machine Learning (ICML-12), ICML '12, pp.1015-1022, 2012.

M. Kuramochi and G. , Karypis : An efficient algorithm for discovering frequent subgraphs. Knowledge and Data Engineering, IEEE Transactions on, vol.16, issue.9, pp.1038-1051, 2004.

. Luo, Spectral embedding of graphs, Pattern Recognition, vol.36, issue.10, pp.2213-2230, 2003.
DOI : 10.1016/S0031-3203(03)00084-0

. Luo, A spectral approach to learning structural variations in graphs, Pattern Recognition, vol.39, issue.6, pp.1188-1198, 2006.
DOI : 10.1016/j.patcog.2006.01.001

. Luqman, Fuzzy multilevel graph embedding, Pattern Recognition, vol.46, issue.2, pp.551-565, 2013.
DOI : 10.1016/j.patcog.2012.07.029
URL : https://hal.archives-ouvertes.fr/hal-01022622

. Mahé, Extensions of marginalized graph kernels, Twenty-first international conference on Machine learning , ICML '04, p.70, 2004.
DOI : 10.1145/1015330.1015446

P. Mahé and J. Vert, Graph kernels based on tree patterns for molecules, Machine Learning, pp.3-35, 2008.
DOI : 10.1007/s10994-008-5086-2

. Mahé, . Vert-09-]-p, and J. Mahé, Vert : Graph kernels based on tree patterns for molecules, Machine Learning, pp.3-35, 2008.

]. H. Morgan, The Generation of a Unique Machine Description for Chemical Structures-A Technique Developed at Chemical Abstracts Service., Journal of Chemical Documentation, vol.5, issue.2, pp.107-113, 1965.
DOI : 10.1021/c160017a018

M. Neuhaus and H. Bunke, Bridging the gap between graph edit distance and kernel machines, volume 68 de Series in Machine Perception and Artificial Intelligence, 2007.

X. Ong, S. Mary, A. J. Canu, and . Smola, Learning with non-positive kernels, Twenty-first international conference on Machine learning , ICML '04, p.81, 2004.
DOI : 10.1145/1015330.1015443

. Poezevara, Crémilleux : Discovering emerging graph patterns from chemicals, Proceedings of the 18th International Symposium on Methodologies for Intelligent Systems, pp.45-55, 2009.

. Ralaivola, Graph kernels for chemical informatics, Neural networks : the official journal of the International Neural Network Society, pp.1093-110, 2005.
DOI : 10.1016/j.neunet.2005.07.009

J. Ramon and T. Gärtner, Expressivity versus efficiency of graph kernels, First International Workshop on Mining Graphs, Trees and Sequences, pp.65-74, 2003.

R. C. Read, Bound on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, vol.5, pp.237-252, 1975.

H. Neuhaus and . Bunke, Graph embedding in vector spaces by means of prototype selection, F. Escolano, M. Vento, éditeurs : 6th IAPR-TC15 International Workshop GbRPR, pp.383-393, 2007.

. Riesen, . Bunke-09a-]-k, H. Riesen, and . Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image and Vision Computing, vol.27, issue.7, pp.950-959, 2009.
DOI : 10.1016/j.imavis.2008.04.004

. Riesen, . Bunke-09b-]-k, H. Riesen, and . Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image and Vision Computing, vol.27, issue.7, pp.950-959, 2009.
DOI : 10.1016/j.imavis.2008.04.004

R. Et-hahn-10, ]. D. Rogers, and M. Hahn, Extendedconnectivity fingerprints, Journal of Chemical Information and Modeling, vol.50, issue.5, pp.742-54, 2010.

A. Smola and R. Kondor, Kernels and Regularization on Graphs, Warmuth, éditeurs : Learning Theory and Kernel Machines, pp.144-158
DOI : 10.1007/978-3-540-45167-9_12

S. Berlin, /. Heidelberg, F. Steinke, B. R. Todeschini, V. Consonni et al., Schölkopf : Kernels, regularization and differential equations [Tibshirani 96] R. Tibshirani : Regression shrinkage and selection via the lasso Molecular Descriptors for Chemoinformatics Helma : Statistical evaluation of the predictive toxicology challenge Vapnik : The Nature of Statistical Learning Theory, Todeschini et Consonni 09 Computer Vision IEEE 11th International Conference on, pp.3271-3286, 1984.

K. Borgwardt and N. , Vert : The optimal assignment kernel is not positive definite. CoRR, abs/0801 Schraudolph : Fast computation of graph kernels, Advances in Neural Information Processing Systems, p.1449, 2007.

P. Vismara, Reconnaissance et représentation d'éléments structuraux pour la description d'objets complexes. Application à l'élaboration de stratégies de synthèse en chimie organique, Thèse de doctorat, 1995.

. Voigt, Comparison of the NCI Open Database with Seven Large Chemical Structural Databases, Journal of Chemical Information and Computer Sciences, vol.41, issue.3, pp.702-712, 2001.
DOI : 10.1021/ci000150t

I. Wale and G. Watson, Comparison of descriptor spaces for chemical compound retrieval and classification, Knowledge and Information Systems, vol.38, issue.6, pp.347-375, 2008.
DOI : 10.1007/s10115-007-0103-5

W. T. Wipke and T. M. Dyott, Use of Ring Assemblies in Ring Perception Algorithm, Journal of Chemical Information and Modeling, vol.15, issue.3, pp.140-147, 1975.
DOI : 10.1021/ci60003a003

Y. , H. , ]. X. Yan, and J. , Han : gspan : Graph-based substructure pattern mining, Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM '02, p.721, 2002.

F. Yger and A. , Wavelet kernel learning, Pattern Recognition, vol.44, issue.10-11, pp.2614-2629, 2011.
DOI : 10.1016/j.patcog.2011.03.006
URL : https://hal.archives-ouvertes.fr/hal-00510484

. Zhang, On the editing distance between unordered labeled trees, Information Processing Letters, vol.42, issue.3, pp.133-139, 1992.
DOI : 10.1016/0020-0190(92)90136-J

.. Structures-non-linéaires-et-l-'étiquetage-Étendu-de-morgan, La valeur de l'étiquette étendue est indiquée à proximité de chaque noeud. Les permutations possibles sont représentées par des noeuds en forme de carrés. Les différentes permutations possibles dans une même structure sont représentées par des niveaux de gris différents, p.90

H. De and G. Ch, Les treelets de l'ensemble T 1 n'encodent pas la relation d'adjacence entre l'atome O et les deux cycles C 1 et C 2 . Les treelets de l'ensemble T 2 encodent quant à eux la relation d'adjacence entre l'atome O et les deux cycles C 1 et C 2 . Toutefois, les treelets n'encodant pas cette relation ne sont pas inclus dans T 2, Exemples non exhaustifs de treelets inclus dans T 1 et T 2 extraits, p.124