{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:23:28Z","timestamp":1767374608851},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642411892"},{"type":"electronic","value":"9783642411908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41190-8_44","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T04:13:58Z","timestamp":1378181638000},"page":"409-417","source":"Crossref","is-referenced-by-count":20,"title":["Performance Comparison of Five Exact Graph Matching Algorithms on Biological Databases"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Carletti","sequence":"first","affiliation":[]},{"given":"Pasquale","family":"Foggia","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Vento","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"44_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/bib\/bbl022","volume":"7","author":"T. Aittokallio","year":"2006","unstructured":"Aittokallio, T., Schwikowski, B.: Graph-based methods for analysing networks in cell biology. Briefings in Bioinformatics\u00a07(3), 243\u2013255 (2006)","journal-title":"Briefings in Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Bomze, M., Budinich, M., Pardalos, M., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization 4 (1999)","key":"44_CR2","DOI":"10.1007\/978-1-4757-3023-4_1"},{"doi-asserted-by":"crossref","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinformatics 14 (2013)","key":"44_CR3","DOI":"10.1186\/1471-2105-14-S7-S13"},{"issue":"3","key":"44_CR4","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in Pattern Recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"44_CR5","series-title":"SCI","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-68020-8_4","volume-title":"Applied Graph Theory in Computer Vision and Pattern Recognition","author":"D. Conte","year":"2007","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: How and why pattern recognition and computer vision applications use graphs. In: Kandel, A., Bunke, H., Last, M. (eds.) Applied Graph Theory in Computer Vision and Pattern Recognition. SCI, vol.\u00a052, pp. 85\u2013135. Springer, Heidelberg (2007)"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L. Cordella","year":"2004","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026, 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"doi-asserted-by":"crossref","unstructured":"De Santo, M., Foggia, P., Percannella, G., Sansone, C., Vento, M.: An unsupervised algorithm for anchor shot detection. In: Proceedings - International Conference on Pattern Recognition, vol.\u00a02, pp. 1238\u20131241 (2006)","key":"44_CR7","DOI":"10.1109\/ICPR.2006.266"},{"unstructured":"Durand, P., Pasari, R., Baker, J., Tsai, C.C.: An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry\u00a02 (1999)","key":"44_CR8"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1142\/S0218001408006557","volume":"22","author":"P. Foggia","year":"2008","unstructured":"Foggia, P., Percannella, G., Sansone, C., Vento, M.: A graph-based algorithm for cluster detection. International Journal of Pattern Recognition and Artificial Intelligence\u00a022, 843\u2013860 (2008)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"44_CR10","first-page":"1","volume":"2","author":"E. Gifford","year":"1996","unstructured":"Gifford, E., Johnson, M., Smith, D., Tsai, C.C.: Structure-reactivity maps as a tool for visualizing xenobiotic structure-reactivity relationships. Network Science\u00a02, 1\u201333 (1996)","journal-title":"Network Science"},{"unstructured":"Giugno, R.: Ri website, \n                    \n                      http:\/\/ferrolab.dmi.unict.it\/ri\/ri.html","key":"44_CR11"},{"doi-asserted-by":"crossref","unstructured":"Huan, J., et al.: Comparing graph representations of protein structure for mining family-specific residue-based packing motif. Journal of Computational Biology (2005)","key":"44_CR12","DOI":"10.1089\/cmb.2005.12.657"},{"issue":"1","key":"44_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/jcc.540050105","volume":"5","author":"F.S. Kuhl","year":"1984","unstructured":"Kuhl, F.S., Crippen, G.M., Friesen, D.K.: A combinatorial algorithm for calculating ligand binding. Journal of Computational Chemistry\u00a05(1), 24\u201334 (1984)","journal-title":"Journal of Computational Chemistry"},{"doi-asserted-by":"crossref","unstructured":"Lacroix, V., Fernandez, C., Sagot, M.: Motif search in graphs: Application to metabolic networks. Transactions on Computational Biology and Bioinformatics (December 2006)","key":"44_CR14","DOI":"10.1109\/TCBB.2006.55"},{"issue":"5594","key":"44_CR15","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science\u00a0298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"7","key":"44_CR16","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. Journal of Computer-Aided Molecular Design\u00a016(7), 521\u2013533 (2002)","journal-title":"Journal of Computer-Aided Molecular Design"},{"unstructured":"Solnon, C.: Lad website, \n                    \n                      http:\/\/liris.cnrs.fr\/csolnon\/LAD.html","key":"44_CR17"},{"issue":"12-13","key":"44_CR18","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C. Solnon","year":"2010","unstructured":"Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artificial Intelligence\u00a0174(12-13), 850\u2013864 (2010)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"44_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y. Tian","year":"2007","unstructured":"Tian, Y., McEachin, R.C., Santos, C., States, D.J., Patel, J.M.: Saga: A subgraph matching tool for biological graphs. Bioinformatics\u00a023(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"Ullman, J.R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach.\u00a023, 31\u201342 (1976)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","New Trends in Image Analysis and Processing \u2013 ICIAP 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41190-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T01:24:08Z","timestamp":1558056248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41190-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411892","9783642411908"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41190-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}