{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:53:47Z","timestamp":1725519227171},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540884101"},{"type":"electronic","value":"9783540884118"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88411-8_20","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T04:09:58Z","timestamp":1223352598000},"page":"197-209","source":"Crossref","is-referenced-by-count":9,"title":["An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules"],"prefix":"10.1007","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"}]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"16","key":"20_CR1","doi-asserted-by":"publisher","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\u00a023(16), 2038\u20132045 (2007)","journal-title":"Bioinformatics"},{"issue":"5","key":"20_CR2","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 Recognition Letters\u00a034(5), 1075\u20131091 (2001)","journal-title":"Pattern Recognition Letters"},{"key":"20_CR3","volume-title":"Concepts and Applications of Molecular Similarity","author":"M. Johnson","year":"1990","unstructured":"Johnson, M., Maggiora, G.: Concepts and Applications of Molecular Similarity. John Wiley, Chichester (1990)"},{"issue":"8","key":"20_CR4","doi-asserted-by":"publisher","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 Transactions on Knowledge and Data Engineering\u00a017(8), 1036\u20131050 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"20_CR5","doi-asserted-by":"publisher","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. Computer-Aided Molecular Design\u00a016, 521\u2013533 (2002)","journal-title":"Computer-Aided Molecular Design"},{"key":"20_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., New York (1979)"},{"issue":"5","key":"20_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S.L. Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Information Processing Letters\u00a09(5), 229\u2013232 (1979)","journal-title":"Information Processing Letters"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proceedings of the 12th ACM SIGKDD, pp. 197\u2013206 (2006)","DOI":"10.1145\/1150402.1150427"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1038\/194178b0","volume":"194","author":"C. Hansch","year":"1962","unstructured":"Hansch, C., Maolney, P., Fujita, T., R.M.: Correlation of biological activity of phenoxyacetic acids with hammett substituent constants and partition coefficients. Nature\u00a0194, 178\u2013180 (1962)","journal-title":"Nature"},{"issue":"23\/24","key":"20_CR10","doi-asserted-by":"publisher","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 Discovery Today\u00a011(23\/24), 1046\u20131051 (2006)","journal-title":"Drug Discovery Today"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.93.1.438","volume":"93","author":"R. King","year":"1996","unstructured":"King, R., Muggleton, S., Srinivasan, A., Sternberg, M.: Structure-activity relationships derived by machine learning: The use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. PNAS\u00a093, 438\u2013442 (1996)","journal-title":"PNAS"},{"key":"20_CR12","first-page":"721","volume-title":"Proceedings of the IEEE Int. Conf. on Data Mining","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the IEEE Int. Conf. on Data Mining, pp. 721\u2013724. IEEE Computer Society, Los Alamitos (2002)"},{"issue":"suppl_1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/bioinformatics\/bti1055","volume":"21","author":"S.J. 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\u00a021(suppl_1), 359\u2013368 (2005)","journal-title":"Bioinformatics"},{"key":"20_CR14","doi-asserted-by":"publisher","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. Computer Journal\u00a045, 631\u2013644 (2002)","journal-title":"Computer Journal"},{"key":"20_CR15","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2000)"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a017(1), 91\u201397 (1982)","journal-title":"Theoretical Computer Science"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters\u00a018, 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"key":"20_CR18","doi-asserted-by":"publisher","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. Journal of Computer-Aided Design\u00a016, 59\u201371 (2002)","journal-title":"Journal of Computer-Aided Design"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics\u00a05, 32\u201338 (1957)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"20_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0907-3","volume-title":"Learning to Classify Text using Support Vector Machines: Methods, Theory, and Algorithms","author":"T. Joachims","year":"2002","unstructured":"Joachims, T.: Learning to Classify Text using Support Vector Machines: Methods, Theory, and Algorithms. Springer, Heidelberg (2002)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Zimmermann, A., De Raedt, L., Nijssen, S.: Don\u2019t be afraid of simpler patterns. In: Proc. of the 10th European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 55\u201366 (2006)","DOI":"10.1007\/11871637_10"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88411-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:31:53Z","timestamp":1558265513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88411-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884101","9783540884118"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88411-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}