{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:47Z","timestamp":1759063787635,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319581620"},{"type":"electronic","value":"9783319581637"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58163-7_4","type":"book-chapter","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T06:59:25Z","timestamp":1493017165000},"page":"62-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Algorithm for Large Common Connected Induced Subgraphs"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Tattini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Versari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,25]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/jmbi.1994.1657","volume":"243","author":"P Artymiuk","year":"1994","unstructured":"Artymiuk, P., Poirrette, A., Grindley, H., Rice, D., Willett, P.: A graph-theoretic approach to the identification of three-dimensional patterns of amino acid side-chains in protein structures. J Mol. Biol. 243(2), 327\u2013344 (1994)","journal-title":"J Mol. Biol."},{"issue":"5","key":"4_CR2","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1002\/asi.20140","volume":"56","author":"P Artymiuk","year":"2005","unstructured":"Artymiuk, P., Spriggs, R., Willett, P.: Graph theoretic methods for the analysis of structural relationships in biological macromolecules. J. AM. Soc. Inf. Sci. Technol. 56(5), 518\u2013528 (2005)","journal-title":"J. AM. Soc. Inf. Sci. Technol."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1), 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"4_CR4","volume-title":"Chemical Graph Theory: Introduction and Fundamentals","author":"D Bonchev","year":"1991","unstructured":"Bonchev, D.: Chemical Graph Theory: Introduction and Fundamentals. CRC Press, Boca Raton (1991)"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1021\/ci00056a002","volume":"27","author":"A Brint","year":"1987","unstructured":"Brint, A., Willett, P.: Algorithms for the identification of three-dimensional maximal common substructures. J. Chem. Inf. Comput. Sci. 27(4), 152\u2013158 (1987)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"9","key":"4_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"unstructured":"Brun, L., Ga\u00fcz\u00e8re, B., Fourey, S.: Relationships between graph edit distance and maximal common unlabeled subgraph. Technical report, HAL Id: hal-00714879, July 2012","key":"4_CR7"},{"issue":"15","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1093\/bioinformatics\/btn307","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao, Y., Charisi, A., Cheng, L., Jiang, T., Girke, T.: ChemmineR: a compound mining framework for R. Bioinformatics 24(15), 1733\u20131734 (2008)","journal-title":"Bioinformatics"},{"issue":"13","key":"4_CR9","doi-asserted-by":"publisher","first-page":"i366","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":"6","key":"4_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9(6), 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"unstructured":"Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques. In: ICALP (2016)","key":"4_CR11"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.7155\/jgaa.00139","volume":"11","author":"D Conte","year":"2007","unstructured":"Conte, D., Foggia, P., Vento, M.: Challenging complexity of maximum common subgraph detection algorithms: a performance analysis of three algorithms on a wide database of graphs. J. Graph Algorithms Appl. 11(1), 99\u2013143 (2007)","journal-title":"J. Graph Algorithms Appl."},{"unstructured":"Holder, L.: PDB-to-graph program (2015). https:\/\/github.com\/mikeizbicki\/datasets\/tree\/master\/graph\/pdb2graph. Accessed 04 May 2016","key":"4_CR13"},{"doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 581\u2013586. ACM (2004)","key":"4_CR14","DOI":"10.1145\/1014052.1014123"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-55210-3_198","volume-title":"STACS 92","author":"V Kann","year":"1992","unstructured":"Kann, V.: On the approximability of the maximum common subgraph problem. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 375\u2013388. Springer, Heidelberg (1992). doi:10.1007\/3-540-55210-3_198"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","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), 1\u201330 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1089\/cmb.1996.3.289","volume":"3","author":"I Koch","year":"1996","unstructured":"Koch, I., Lengauer, T., Wanke, E.: An algorithm for finding maximal common subtopologies in a set of protein structures. J. Comput. Biol. 3(2), 289\u2013306 (1996)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"4_CR18","first-page":"591","volume":"34","author":"E Krissinel","year":"2004","unstructured":"Krissinel, E., Henrick, K.: Common subgraph isomorphism detection by backtracking search. Softw.: Pract. Experience 34(6), 591\u2013607 (2004)","journal-title":"Softw.: Pract. Experience"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1973","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. CALCOLO 9(4), 341\u2013352 (1973)","journal-title":"CALCOLO"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"J Mcgregor","year":"1982","unstructured":"Mcgregor, J.: Backtrack search algorithm and the maximal common subgraph problem. Softw. Pract. Experience 12, 23\u201334 (1982)","journal-title":"Softw. Pract. Experience"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"2002","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, 2002 (2002)","journal-title":"Comput. J."},{"issue":"17","key":"4_CR22","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/S1359-6446(02)02411-X","volume":"7","author":"R Sheridan","year":"2002","unstructured":"Sheridan, R., Kearsley, S.: Why do we need so many chemical similarity search methods? Drug Discov. Today 7(17), 903\u2013911 (2002)","journal-title":"Drug Discov. Today"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/11533719_73","volume-title":"Computing and Combinatorics","author":"WH Suters","year":"2005","unstructured":"Suters, W.H., Abu-Khzam, F.N., Zhang, Y., Symons, C.T., Samatova, N.F., Langston, M.A.: A new approach and faster exact methods for the maximum common subgraph problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 717\u2013727. Springer, Heidelberg (2005). doi:10.1007\/11533719_73"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J Ullmann","year":"1976","unstructured":"Ullmann, J.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1504\/IJBRA.2013.054688","volume":"9","author":"R Van Berlo","year":"2013","unstructured":"Van Berlo, R., Winterbach, W., De Groot, M., Bender, A., Verheijen, P., Reinders, M., de Ridder, D.: Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels. Int. J. Bioinform. Res. Appl. 9(4), 407\u2013432 (2013)","journal-title":"Int. J. Bioinform. Res. Appl."},{"unstructured":"Versari, L.: Ricerca veloce di pattern comuni a due grafi. Master\u2019s thesis, University of Pisa, Pisa, Bachelor Thesis (in Italian), University of Pisa (2015)","key":"4_CR26"},{"issue":"5","key":"4_CR27","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1021\/ci9601675","volume":"37","author":"T Wang","year":"1997","unstructured":"Wang, T., Zhou, J.: EMCSS: a new method for maximal common substructure search. J. Chem. Inf. Comput. Sci. 37(5), 828\u2013834 (1997)","journal-title":"J. Chem. Inf. Comput. Sci."},{"unstructured":"Welling, R.: A performance analysis on maximal common subgraph algorithms. In: 15th Twente Student Conference on IT, University of Twente, The Netherlands (2011)","key":"4_CR28"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58163-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:16:52Z","timestamp":1710166612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58163-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319581620","9783319581637"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58163-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/AlCoB2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}