{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:10:05Z","timestamp":1768029005677,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319182230","type":"print"},{"value":"9783319182247","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18224-7_17","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"168-177","source":"Crossref","is-referenced-by-count":23,"title":["VF2 Plus: An Improved version of VF2 for Biological Graphs"],"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":[{"key":"17_CR1","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)","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-41190-8_44","volume-title":"New Trends in Image Analysis and Processing \u2013 ICIAP 2013","author":"V. Carletti","year":"2013","unstructured":"Carletti, V., Foggia, P., Vento, M.: Performance Comparison of Five Exact Graph Matching Algorithms on Biological Databases. In: Petrosino, A., Maddalena, L., Pala, P. (eds.) ICIAP 2013. LNCS, vol.\u00a08158, pp. 409\u2013417. Springer, Heidelberg (2013)"},{"issue":"3","key":"17_CR3","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":"17_CR4","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"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Dahm, N., Bunke, H., Caelli, T., Gao, Y.: Efficient subgraph matching using topological node feature constraints. Pattern Recognition (June 2014)","DOI":"10.1016\/j.patcog.2014.05.018"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph Matching And Learning In Pattern Recognition On The Last Ten Years. \u2026Journal of Pattern Recognition \u2026(2014)","DOI":"10.1142\/S0218001414500013"},{"key":"17_CR7","unstructured":"Han, W.S., Lee, J.H., Lee, J.H.: Turbo Iso: Towards Ultrafast And Robust Subgraph Isomorphism Search In Large Graph Databases. In: \u2026of the 2013 International Conference on \u2026, pp. 337\u2013348 (2013)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-At-A-Time: Query Language And Access Methods For Graph Databases. In: Proceedings of the 2008 ACM SIGMOD International \u2026, pp. 405\u2013417 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"17_CR9","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)","DOI":"10.1089\/cmb.2005.12.657"},{"key":"17_CR10","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 (Dicember 2006)","DOI":"10.1109\/TCBB.2006.55"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J. Larrosa","year":"2002","unstructured":"Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Computer Science\u00a012, 403\u2013422 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"J. McGregor","year":"1979","unstructured":"McGregor, J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Sciences\u00a019(3), 229\u2013250 (1979)","journal-title":"Information Sciences"},{"key":"17_CR13","unstructured":"RCSB: Protein data bank web site (June 2015), \n                        http:\/\/www.rcsb.org\/pdb"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism, pp. 364\u2013375 (2008)","DOI":"10.14778\/1453856.1453899"},{"issue":"12-13","key":"17_CR15","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"},{"key":"17_CR16","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."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Ullmann, J.: Bit-Vector Algorithms For Binary Constraint Satisfaction And Subgraph Isomorphism. Journal of Experimental Algorithmics (JEA) 15(1) (2010)","DOI":"10.1145\/1671970.1921702"},{"key":"17_CR18","unstructured":"Vento, M.: A Long Tri. In: The Charming World Of Graphs For Pattern Recognition. Pattern Recognition, 1\u201311 (January 2014)"},{"key":"17_CR19","unstructured":"Vento, M., Jiang, X., Foggia, P.: International contest on pattern search in biological databases (June 2015), \n                        http:\/\/biograph2014.unisa.it"},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S. Zampelli","year":"2010","unstructured":"Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints\u00a015(3), 327\u2013353 (2010)","journal-title":"Constraints"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: Distance Index Based Subgraph Matching In Biological Networks. In: \u2026of the 12th International Conference on \u2026(2009)","DOI":"10.1145\/1516360.1516384"},{"issue":"1-2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P. Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On Graph Query Optimization In Large Networks. Proceedings of the VLDB Endowment\u00a03(1-2), 340\u2013351 (2010)","journal-title":"Proceedings of the VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18224-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:30:22Z","timestamp":1674559822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}