P. Artymiuk, A. Poirrette, H. Grindley, D. Rice, and P. Willett, A Graph-theoretic Approach to the Identification of Three-dimensional Patterns of Amino Acid Side-chains in Protein Structures, Journal of Molecular Biology, vol.243, issue.2, pp.327-344, 1994.
DOI : 10.1006/jmbi.1994.1657

P. Artymiuk, R. Spriggs, and P. Willett, Graph theoretic methods for the analysis of structural relationships in biological macromolecules, Journal of the American Society for Information Science and Technology, vol.386, issue.5, pp.518-528, 2005.
DOI : 10.1145/321921.321925

D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1-3, pp.21-46, 1996.
DOI : 10.1016/0166-218X(95)00026-N
URL : http://doi.org/10.1016/0166-218x(95)00026-n

D. Bonchev, Chemical Graph Theory: Introduction and Fundamentals, Boca Raton, 1991.

A. Brint and P. Willett, Algorithms for the identification of three-dimensional maximal common substructures, Journal of Chemical Information and Modeling, vol.27, issue.4, pp.152-158, 1987.
DOI : 10.1021/ci00056a002

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-576, 1973.
DOI : 10.1145/362342.362367

L. Brun, B. Gaüzère, S. Fourey, and . Id, Relationships between graph edit distance and maximal common unlabeled subgraph, p.714879, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00714879

Y. Cao, A. Charisi, L. Cheng, T. Jiang, and T. Girke, ChemmineR: a compound mining framework for R, Bioinformatics, vol.24, issue.15, pp.1733-1734, 2008.
DOI : 10.1093/bioinformatics/btn307
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2638865

Y. Cao, T. Jiang, and T. Girke, A maximum common substructure-based algorithm for searching and predicting drug-like compounds, Bioinformatics, vol.24, issue.13, pp.366-374, 2008.
DOI : 10.1093/bioinformatics/btn186
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2718661

R. Carraghan and P. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters, vol.9, issue.6, pp.375-382, 1990.
DOI : 10.1016/0167-6377(90)90057-C

A. Conte, R. Grossi, A. Marino, and L. Versari, Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques, p.ICALP, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01388461

D. Conte, P. Foggia, and M. Vento, Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs, Journal of Graph Algorithms and Applications, vol.11, issue.1, pp.99-143, 2007.
DOI : 10.7155/jgaa.00139
URL : https://hal.archives-ouvertes.fr/hal-01408699

L. Holder, PDB-to-graph program (2015). https://github.com/mikeizbicki/ datasets/tree/master/graph/pdb2graph, 2016.

J. Huan, W. Wang, J. Prins, and J. Yang, SPIN, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.581-586, 2004.
DOI : 10.1145/1014052.1014123

V. Kann, On the approximability of the maximum common subgraph problem, STACS 1992, pp.375-388, 1992.
DOI : 10.1007/3-540-55210-3_198

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

I. Koch, T. Lengauer, and E. Wanke, An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures, Journal of Computational Biology, vol.3, issue.2, pp.289-306, 1996.
DOI : 10.1089/cmb.1996.3.289

E. Krissinel and K. Henrick, Common subgraph isomorphism detection by backtracking search, Software: Practice and Experience, vol.34, issue.6, pp.591-607, 2004.
DOI : 10.1002/spe.588

G. Levi, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo, vol.3, issue.4, pp.341-352, 1973.
DOI : 10.1007/BF02575586

J. Mcgregor, Backtrack search algorithms and the maximal common subgraph problem, Software: Practice and Experience, vol.23, issue.1, pp.23-34, 1982.
DOI : 10.1145/362515.362562

J. Raymond, E. Gardiner, and P. Willett, RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs, The Computer Journal, vol.45, issue.6, p.2002, 2002.
DOI : 10.1093/comjnl/45.6.631

R. Sheridan and S. Kearsley, Why do we need so many chemical similarity search methods?, Drug Discovery Today, vol.7, issue.17, pp.903-911, 2002.
DOI : 10.1016/S1359-6446(02)02411-X

W. H. Suters, F. N. Abu-khzam, Y. Zhang, C. T. Symons, N. F. Samatova et al., A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem, COCOON 2005, pp.717-72710, 1007.
DOI : 10.1007/11533719_73

J. Ullmann, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976.
DOI : 10.1145/321921.321925
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.7741

R. Van-berlo, W. Winterbach, M. De-groot, A. Bender, P. Verheijen et al., Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels, International Journal of Bioinformatics Research and Applications, vol.9, issue.4, pp.407-432, 2013.
DOI : 10.1504/IJBRA.2013.054688

L. Versari, Ricerca veloce di pattern comuni a due grafi Master's thesis, 2015.

T. Wang and J. Zhou, EMCSS:? A New Method for Maximal Common Substructure Search, Journal of Chemical Information and Computer Sciences, vol.37, issue.5, pp.828-834, 1997.
DOI : 10.1021/ci9601675

R. Welling, A performance analysis on maximal common subgraph algorithms, 15th Twente Student Conference on IT, 2011.