Chemminer: a compound mining framework for r, Bioinformatics, vol.24, issue.15, pp.1733-1734, 2008. ,
Enumerating all connected maximal common subgraphs in two graphs, Theor Comput Sci, vol.250, issue.1, pp.1-30, 2001. ,
An algorithm for finding maximal common subtopologies in a set of protein structures, J Comput Biol, vol.3, issue.2, pp.289-306, 1996. ,
Spin: mining maximal frequent subgraphs from graph databases, Proc. of the tenth ACM SIGKDD, pp.581-586, 2004. ,
A note on the derivation of maximal common subgraphs of two directed or undirected graphs, CALCOLO, vol.9, issue.4, pp.341-352, 1973. ,
Sublinear-space boundeddelay enumeration for massive network analytics: Maximal cliques, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, vol.148, p.15, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01388461
A fast algorithm for large common connected induced subgraphs, Algorithms for Computational Biology -4th International Conference, pp.62-74, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01555996
A fast algorithm for large common connected induced subgraphs, WEPA 2016 : First Workshop on Enumeration Problems and Applications, pp.21-22, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01555996
, , 2016.
Graph theoretic methods for the analysis of structural relationships in biological macromolecules, J AM Soc Inf Sci Tec, vol.56, issue.5, pp.518-528, 2005. ,
Chemical graph theory: introduction and fundamentals, CRC, 1991. ,
Clique-detection algorithms for matching 3-dimensional molecular structures, J Mol Graph Model, vol.15, pp.245-253, 1997. ,
A graphtheoretic approach to the identification of three-dimensional patterns of amino acid side-chains in protein structures, J Molecular Biology, vol.243, issue.2, pp.327-344, 1994. ,
Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels, Int J Bioinformatics Res Appl, vol.9, issue.4, pp.407-432, 2013. ,
Systematic analysis of enzyme-catalyzed reaction patterns and prediction of microbial biodegradation pathways, J Chem Inf Model, vol.47, issue.4, pp.1702-1712, 2007. ,
Why do we need so many chemical similarity search methods?, Drug Discov Today, vol.7, issue.17, pp.903-911, 2002. ,
Maximum common induced subgraph parameterized by vertex cover, Inf Process Lett, vol.114, issue.3, pp.99-103, 2014. ,
Relationships between Graph Edit Distance and Maximal Common Unlabeled Subgraph, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00714879
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs, J Graph Algorithms Appl, vol.11, issue.1, pp.99-143, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01408699
On the approximability of the maximum common subgraph problem, Proc. of STACS '92, pp.377-388, 1992. ,
Rascal: Calculation of graph similarity using maximum common edge subgraphs, Comput J, vol.45, 2002. ,
Matching Relational Structures and Maximal Cliques, Inf Process Lett, vol.4, pp.83-84, 1976. ,
Algorithms for the identification of threedimensional maximal common substructures, J Chem Inf Comput Sci, vol.27, issue.4, pp.152-158, 1987. ,
Maximum common subgraph: some upper bound and lower bound results, BMC Bioinformatics, vol.7, issue.4, p.6, 2006. ,
Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review, Wiley Interdisciplinary Reviews: Computational Molecular Science, vol.1, issue.1, pp.68-79, 2011. ,
Molecular structure comparison program for the identification of maximal common substructures, J Am Chem Soc, vol.99, issue.23, pp.7668-7671, 1977. ,
A maximum common substructure-based algorithm for searching and predicting drug-like compounds, Bioinformatics, vol.24, issue.13, pp.366-374, 2008. ,
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree, Algorithms, vol.6, issue.1, p.119, 2013. ,
A new approach and faster exact methods for the maximum common subgraph problem, Computing and combinatorics, pp.717-727, 2005. ,
Common subgraph isomorphism detection by backtracking search, Software: Practice and Experience, vol.34, issue.6, pp.591-607, 2004. ,
Backtrack search algorithm and the maximal common subgraph problem, Software | Practice and Experience, vol.12, pp.23-34, 1982. ,
Emcss: A new method for maximal common substructure search, J Chem Inf Comput Sci, vol.37, issue.5, pp.828-834, 1997. ,
Finding largest subtrees and smallest supertrees, Algorithmica, vol.21, issue.2, pp.183-210, 1998. ,
Finding all cliques of an undirected graph (algorithm 457), Commun ACM, vol.16, issue.9, pp.575-576, 1973. ,
An exact algorithm for the maximum clique problem, Oper Res Lett, vol.9, issue.6, pp.375-382, 1990. ,
Graph theory and model collection management: conceptual framework and runtime analysis of selected graph algorithms, Information Systems and e-Business Management, vol.13, issue.1, pp.69-106, 2015. ,
Graph-based methods for protein structure comparison, Data Mining and Knowledge Discovery, vol.3, issue.5, pp.307-320, 2013. ,
A direct algorithm to find a largest common connected induced subgraph of two graphs, International Workshop on Graph-Based Representations in Pattern Recognition, pp.162-171, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00324771
Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms, Modelling, Computation and Optimization in Information Sys. and Management Sciences, pp.358-368, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00315748
A performance analysis on maximal common subgraph algorithms, 15th Twente Student Conference on IT, 2011. ,
Graph similarity search on large uncertain graph databases, The VLDB Journal, vol.24, issue.2, pp.271-296, 2015. ,
Finding maximal common subgraphs via time-space efficient reverse search, 24th International Computing and Combinatorics Conference, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01964709
An algorithm for subgraph isomorphism, J ACM, vol.23, issue.1, pp.31-42, 1976. ,
Enumeration of maximum common subtree isomorphisms with polynomial-delay, International Symposium on Algorithms and Computation, pp.81-93, 2014. ,
Ricerca veloce di pattern comuni a due grafi, 2015. ,
Generating all maximal independent sets: Np-hardness and polynomial-time algorithms, SIAM Journal on Computing, vol.9, issue.3, pp.558-565, 1980. ,
Reverse search for enumeration, Discrete Appl Math, vol.65, issue.1, pp.21-46, 1996. ,
PDB-to-graph program, pp.2016-2021, 2015. ,