{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:21:46Z","timestamp":1764688906840},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T00:00:00Z","timestamp":1363046400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10472-013-9335-0","type":"journal-article","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T11:15:30Z","timestamp":1363000530000},"page":"343-376","source":"Crossref","is-referenced-by-count":14,"title":["A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics"],"prefix":"10.1007","volume":"69","author":[{"given":"Leander","family":"Schietgat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,12]]},"reference":[{"key":"9335_CR1","first-page":"1488","volume":"E76-A","author":"T Akutsu","year":"1993","unstructured":"Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E76-A, 1488\u20131493 (1993)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9335_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Zimmermann, A., De\u00a0Raedt, L., Nijssen, S.: Don\u2019t be afraid of simpler patterns. In: Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp.\u00a055\u201366 (2006)","DOI":"10.1007\/11871637_10"},{"issue":"3\u20134","key":"9335_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett. 19(3\u20134), 255\u2013259 (1998)","journal-title":"Pattern Recogn. Lett."},{"issue":"13","key":"9335_CR4","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1093\/bioinformatics\/btn186","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao, Y., Jiang, T., Girke, T.: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics 24(13), i366\u2013i374 (2008)","journal-title":"Bioinformatics"},{"issue":"16","key":"9335_CR5","doi-asserted-by":"crossref","first-page":"2038","DOI":"10.1093\/bioinformatics\/btm298","volume":"23","author":"A Ceroni","year":"2007","unstructured":"Ceroni, A., Costa, F., Frasconi, P.: Classification of small molecules by two- and three-dimensional decomposition kernels. Bioinformatics 23(16), 2038\u20132045 (2007)","journal-title":"Bioinformatics"},{"issue":"2","key":"9335_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/sam.10004","volume":"1","author":"V Chaoji","year":"2008","unstructured":"Chaoji, V., Al\u00a0Hasan, M., Salem, S., Besson, J., Zaki, M.J.: Origami: A novel and effective approach for mining representative orthogonal graph patterns. Stat. Anal. Data Min. 1(2), 67\u201384 (2008)","journal-title":"Stat. Anal. Data Min."},{"issue":"1\u20132","key":"9335_CR7","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining\u2014an overview. Fundam. Inform. 66(1\u20132), 161\u2013198 (2005)","journal-title":"Fundam. Inform."},{"issue":"3","key":"9335_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"9335_CR9","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L.: Logical and Relational Learning. Springer (2008)","DOI":"10.1007\/978-3-540-88190-2_1"},{"issue":"3","key":"9335_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.patrec.2008.09.007","volume":"30","author":"L Raedt De","year":"2009","unstructured":"De\u00a0Raedt, L., Ramon, J.: Deriving distance metrics from generality relations. Pattern Recogn. Lett. 30(3), 187\u2013191 (2009)","journal-title":"Pattern Recogn. Lett."},{"key":"9335_CR11","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"9335_CR12","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9335_CR13","unstructured":"Diestel, R.: Graph Theory. Springer-Verlag (2000)"},{"key":"9335_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co. (1979)"},{"key":"9335_CR15","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T.: Kernels for Structured Data. World Scientific (2008)","DOI":"10.1142\/6855"},{"key":"9335_CR16","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1038\/194178b0","volume":"194","author":"C Hansch","year":"1962","unstructured":"Hansch, C., Maolney, P.P., Fujita, T., Muir, R.M.: Correlation of biological activity of phenoxyacetic acids with hammett substituent constants and partition coefficients. Nature 194, 178\u2013180 (1962)","journal-title":"Nature"},{"key":"9335_CR17","first-page":"885","volume-title":"ICDM \u201906: Proceedings of the 6th International Conference on Data Mining","author":"H He","year":"2006","unstructured":"He, H., Singh, A.K.: Graphrank: statistical modeling and mining of significant subgraphs in the feature space. In: ICDM \u201906: Proceedings of the 6th International Conference on Data Mining, pp. 885\u2013890. IEEE Computer Society, Washington, DC (2006)"},{"issue":"4","key":"9335_CR18","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1021\/ci034254q","volume":"44","author":"C Helma","year":"2004","unstructured":"Helma, C., Kramer S., De Raedt, L: Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. J. Chem. Inf. Model. 44(4), 1402\u2013141 (2004)","journal-title":"J. Chem. Inf. Model."},{"key":"9335_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: A n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"9335_CR20","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: KDD\u00a0\u201904: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a0158\u2013167 (2004)","DOI":"10.1145\/1014052.1014072"},{"key":"9335_CR21","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In:\u00a0KDD\u00a0\u201906: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a0197\u2013206. Philadelphia, PA (2006)","DOI":"10.1145\/1150402.1150427"},{"issue":"3","key":"9335_CR22","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s10618-009-0162-1","volume":"21","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21(3), 472\u2013508 (2010)","journal-title":"Data Min. Knowl. Discov."},{"key":"9335_CR23","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Learning to Classify Text using Support Vector Machines: Methods, Theory, and Algorithms. Springer (2002)","DOI":"10.1007\/978-1-4615-0907-3"},{"key":"9335_CR24","unstructured":"Johnson, M.A., Maggiora, G.M.: Concepts and Applications of Molecular Similarity. John Wiley (1990)"},{"key":"9335_CR25","unstructured":"Karunaratne, T., Bostr\u00f6m, H.: Learning to classify structured data by graph propositionalization. In: Proceedings of the 2nd IASTED International Conference on Computational Intelligence, pp.\u00a0393\u2013398 (2006)"},{"key":"9335_CR26","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1073\/pnas.93.1.438","volume":"93","author":"RD King","year":"1996","unstructured":"King, R.D., Muggleton, S., Srinivasan, A., Sternberg, M.J.E.: Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. Proc. Natl. Acad. Sci. 93, 438\u2013442 (1996)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1\u20132","key":"9335_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250(1\u20132), 1\u201330 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9335_CR28","doi-asserted-by":"crossref","unstructured":"Kramer, S., De\u00a0Raedt, L., Helma, C.: Molecular feature mining in HIV data. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-01), pp.\u00a0136\u2013143. ACM Press (2001)","DOI":"10.1145\/502512.502533"},{"key":"9335_CR29","doi-asserted-by":"crossref","unstructured":"Kramer, S., Lavra\u010d, N., Flach, P.: Propositionalization approaches to relational data mining. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) Relational Data Mining, pp. 262\u2013291. Springer-Verlag (2001)","DOI":"10.1007\/978-3-662-04599-2_11"},{"key":"9335_CR30","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(89)90011-X","volume":"63","author":"A Lingas","year":"1989","unstructured":"Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theor. Comput. Sci. 63, 295\u2013302 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"9335_CR31","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/1557019.1557089","volume-title":"KDD\u00a0\u201909: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A Maunz","year":"2009","unstructured":"Maunz, A., Helma, C., Kramer, S.: Large-scale graph mining using backbone refinement classes. In: KDD\u00a0\u201909: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 617\u2013626. ACM, New York, NY (2009)"},{"key":"9335_CR32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw. Pract. Exp. 12, 23\u201334 (1982)","journal-title":"Softw. Pract. Exp."},{"issue":"5","key":"9335_CR33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"SL Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Process. Lett. 9(5), 229\u2013232 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9335_CR34","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9335_CR35","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"9335_CR36","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","volume":"45","author":"J Raymond","year":"2002","unstructured":"Raymond, J., Gardiner, E., Willett, P.: Rascal: calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45, 631\u2013644 (2002)","journal-title":"Comput. J."},{"key":"9335_CR37","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1016387816342","volume":"16","author":"J Raymond","year":"2002","unstructured":"Raymond, J., Willett, P.: Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases. J. Comput. Aided Mol. Des. 16, 59\u201371 (2002)","journal-title":"J. Comput. Aided Mol. Des."},{"key":"9335_CR38","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"J Raymond","year":"2002","unstructured":"Raymond, J., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Comput. Aided Mol. Des. 16, 521\u2013533 (2002)","journal-title":"J. Comput. Aided Mol. Des."},{"key":"9335_CR39","doi-asserted-by":"crossref","unstructured":"Schietgat, L., Ramon, J., Bruynooghe, M., Blockeel, H.: An efficiently computable graph-based metric for the classification of small molecules. In:\u00a0Proceedings of the 11th International Conference on Discovery Science, vol. 5255 of Lecture Notes in Artificial Intelligence, pp. 197\u2013209 (2008)","DOI":"10.1007\/978-3-540-88411-8_20"},{"issue":"2","key":"9335_CR40","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10994-010-5193-8","volume":"83","author":"L Schietgat","year":"2011","unstructured":"Schietgat, L., Costa, F., Ramon, J., De\u00a0Raedt, L.: Effective feature construction by maximum common subgraph sampling. Mach. Learn. 83(2), 137\u2013161 (2011)","journal-title":"Mach. Learn."},{"issue":"2","key":"9335_CR41","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R Shamir","year":"1992","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. J. Algorithms 33(2), 267\u2013280 (1992)","journal-title":"J. Algorithms"},{"issue":"5","key":"9335_CR42","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1016\/S0031-3203(00)00048-0","volume":"34","author":"K Shearer","year":"2001","unstructured":"Shearer, K., Bunke, H., Venkatesh, S.: Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recogn. 34(5), 1075\u20131091 (2001)","journal-title":"Pattern Recogn."},{"key":"9335_CR43","unstructured":"Shervashidze, N., Borgwardt, K.: Fast subtree kernels on graphs. In: Bengio, Y., Schuurmans, D., Lafferty, J., Williams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems, vol. 22, pp. 1660\u20131668 (2009)"},{"key":"9335_CR44","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1093\/bioinformatics\/bti1055","volume":"21","author":"SJ Swamidass","year":"2005","unstructured":"Swamidass, S.J., Chen, J., Bruand, J., Phung, P., Ralaivola, L., Baldi, P.: Kernels for small molecules and the prediction of mutagenicity, toxicity and anti-cancer activity. Bioinformatics 21, i359\u2013i368 (2005)","journal-title":"Bioinformatics"},{"issue":"1","key":"9335_CR45","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","volume":"17","author":"M Syslo","year":"1982","unstructured":"Syslo, M.: The subgraph isomorphism problem for outerplanar graphs. Theor. Comp. Sci. 17(1), 91\u201397 (1982)","journal-title":"Theor. Comp. Sci."},{"key":"9335_CR46","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale, N., Watson, I.A., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. Inf. Syst. 14, 347\u2013375 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"9335_CR47","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics 1, 80\u201383 (1945)","journal-title":"Biometrics"},{"issue":"23\/24","key":"9335_CR48","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1016\/j.drudis.2006.10.005","volume":"11","author":"P Willett","year":"2006","unstructured":"Willett, P.: Similarity-based virtual screening using 2D fingerprints. Drug Discov. Today 11(23\/24), 1046\u20131051 (2006)","journal-title":"Drug Discov. Today"},{"key":"9335_CR49","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 721\u2013724. IEEE Computer Society (2002)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9335-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9335-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9335-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T20:09:29Z","timestamp":1562789369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9335-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,12]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9335"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9335-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,12]]}}}