{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:58:45Z","timestamp":1743069525657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166595"},{"type":"electronic","value":"9783030166601"}],"license":[{"start":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T00:00:00Z","timestamp":1555200000000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-16660-1_57","type":"book-chapter","created":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T20:06:56Z","timestamp":1555186016000},"page":"587-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FAST Community Detection for Proteins Graph-Based Functional Classification"],"prefix":"10.1007","author":[{"given":"Arbi","family":"Ben Rejab","sequence":"first","affiliation":[]},{"given":"Imen","family":"Boukhris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,14]]},"reference":[{"issue":"2","key":"57_CR1","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10489-014-0528-y","volume":"41","author":"Gaganmeet Kaur Awal","year":"2014","unstructured":"Awal, G.K., Bharadwaj, K.: Team formation in social networks based on collective intelligence: an evolutionary approach, pp. 627\u2013648 (2014)","journal-title":"Applied Intelligence"},{"key":"57_CR2","unstructured":"Bengoetxea, E.: Inexact graph matching using estimation of distribution algorithms. Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Paris 2(4), 49 (2002)"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Bourne, P.E.: The protein data bank. Nucleic Acids Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks, P1008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Boukhris, I., Elouedi, Z., Fober, T., Mernberger, M., Hullermeier, E.: Similarity analysis of protein binding sites: a generalization of the maximum common subgraph measure based on quasi-clique detection. In: ISDA, pp. 1245\u20131250. IEEE Computer Society (2009)","DOI":"10.1109\/ISDA.2009.75"},{"issue":"9","key":"57_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.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"57_CR7","unstructured":"Cohen, J., Castonguay, P.: Efficient graph matching and coloring on the GPU. In: GPU Technology Conference, pp. 1\u201310 (2012)"},{"issue":"1","key":"57_CR8","first-page":"16","volume":"16","author":"J Daxin","year":"2009","unstructured":"Daxin, J., Jian, P.: Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. 16(1), 16\u201342 (2009)","journal-title":"ACM Trans. Knowl. Discov."},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","volume":"346","author":"F Emmert-Streib","year":"2016","unstructured":"Emmert-Streib, F., Dehmer, M., Shi, Y.: Fifty years of graph matching, network alignment and network comparison. Inf. Sci. 346, 180\u2013197 (2016)","journal-title":"Inf. Sci."},{"issue":"5","key":"57_CR10","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.patrec.2008.12.014","volume":"30","author":"M Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F.: Median graph: a new exact algorithm using a distance based on the maximum common subgraph. Pattern Recogn. Lett. 30(5), 579\u2013588 (2009)","journal-title":"Pattern Recogn. Lett."},{"key":"57_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-00035-0_28","volume-title":"Algorithms from and for Nature and Life","author":"Thomas Fober","year":"2013","unstructured":"Fober, T., Klebe, G., Hullermeier, E.: Local clique merging: an extension of the maximum common subgraph measure with applications in structural bioinformatics. In: Algorithms from and for Nature and Life, pp. 279\u2013286 (2013)"},{"key":"57_CR12","unstructured":"Frasconi, P., Passerini, A.: Predicting the geometry of metal binding sites from protein sequence 9, 203\u2013213 (2012)"},{"key":"57_CR13","unstructured":"Harary, F., Norman, R.Z.: Graph theory as a mathematical model in social science, p. 45 (1953)"},{"issue":"4","key":"57_CR14","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 (1973)","journal-title":"Calcolo"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"57_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.patrec.2015.05.003","volume":"62","author":"S Mallek","year":"2015","unstructured":"Mallek, S., Boukhris, I., Elouedi, Z.: Community detection for graphbased similarity: application to protein binding pockets classification. Pattern Recogn. Lett. 62, 49\u201354 (2015)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"57_CR17","first-page":"23","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw.: Pract. Experience 12(1), 23\u201334 (1982)","journal-title":"Softw.: Pract. Experience"},{"issue":"2","key":"57_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0022-2836(02)00811-2","volume":"323","author":"S Schmitt","year":"2002","unstructured":"Schmitt, S., Kuhn, D., Klebe, G.: A new method to detect related function among proteins independent of sequence and fold homology. J. Mol. Biol. 323(2), 387\u2013406 (2002)","journal-title":"J. Mol. Biol."},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: Fast algorithm for modularity-based graph clustering. In: AAAI, pp. 1170\u20131176 (2013)","DOI":"10.1609\/aaai.v27i1.8455"},{"issue":"1","key":"57_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"57_CR21","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/TCBB.2007.358301","volume":"4","author":"N Weskamp","year":"2007","unstructured":"Weskamp, N., Hullermeier, E., Kuhn, D., Klebe, G.: Multiple graph alignment for the structural analysis of protein active sites. IEEE\/ACM Trans. Comput. Biol. Bioinf. (TCBB) 4(2), 310\u2013320 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf. (TCBB)"},{"issue":"1","key":"57_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.47.1.113","volume":"47","author":"SD Wu","year":"1999","unstructured":"Wu, S.D., Byeon, E.S., Storer, R.: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Oper. Res. 47(1), 113\u2013124 (1999)","journal-title":"Oper. Res."},{"key":"57_CR23","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: Data Mining (ICDM), pp. 1151\u20131156 (2013)","DOI":"10.1109\/ICDM.2013.167"},{"key":"57_CR24","doi-asserted-by":"crossref","unstructured":"Chi, Y., Dai, G., Wang, Y., Sun, G., Li, G., Yang, H.: Nxgraph: an efficient graph processing system on a single machine. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 409-420, May 2016","DOI":"10.1109\/ICDE.2016.7498258"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems Design and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16660-1_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T23:01:16Z","timestamp":1663282876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16660-1_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,14]]},"ISBN":["9783030166595","9783030166601"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16660-1_57","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,4,14]]},"assertion":[{"value":"14 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISDA 2018","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems Design and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vellore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isda2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/isda18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}