{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:50:53Z","timestamp":1742939453392,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319113098"},{"type":"electronic","value":"9783319113104"}],"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-11310-4_54","type":"book-chapter","created":{"date-parts":[[2014,9,20]],"date-time":"2014-09-20T15:10:08Z","timestamp":1411225808000},"page":"629-639","source":"Crossref","is-referenced-by-count":1,"title":["Predicting Proteins Functional Family: A Graph-Based Similarity Derived from Community Detection"],"prefix":"10.1007","author":[{"given":"Sabrine","family":"Mallek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imen","family":"Boukhris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zied","family":"Elouedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"54_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H.M. Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucleic Acids Res.\u00a028(1), 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of community hierarchies in large networks. CoRR abs\/0803.0476 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"Boukhris, I., Elouedi, Z., Fober, T., Mernberger, M., H\u00fcllermeier, E.: Similarity analysis of protein binding sites: A generalization of the maximum common subgraph measure based on quasi-clique detection. In: International Conference on Intelligent Systems Design and Applications, ISDA, pp. 1245\u20131250 (2009)","DOI":"10.1109\/ISDA.2009.75"},{"key":"54_CR4","unstructured":"Bunke, H.: Recent developments in graph matching. In: ICPR, pp. 2117\u20132124 (2000)"},{"key":"54_CR5","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., Valvenya, E., Serratosa, F.: Median graph: A new exact algorithm using a distance based on the maximum common subgraph. Pattern Recognition Letters\u00a030, 579\u2013588 (2009)","journal-title":"Pattern Recognition Letters"},{"key":"54_CR6","first-page":"21","volume":"157","author":"T. Fober","year":"2009","unstructured":"Fober, T., Mernberger, M., Moritz, R., Hullermeier, E.: Graph-kernels for the comparative analysis of protein active sites. GI\u00a0157, 21\u201331 (2009)","journal-title":"GI"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Fober, T., Klebe, G., H\u00fcllermeier, 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. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 279\u2013286. Springer (2013)","DOI":"10.1007\/978-3-319-00035-0_28"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486, 75\u2013174 (2010)","journal-title":"Physics Reports"},{"issue":"4","key":"54_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S1093-3263(97)00089-2","volume":"15","author":"E.J. Gardiner","year":"1997","unstructured":"Gardiner, E.J., Artymiuk, P.J., Willett, P.: Clique-detection algorithms for matching three-dimensional molecular structures. Journal of Molecular Graphics and Modelling\u00a015(4), 245\u2013253 (1997)","journal-title":"Journal of Molecular Graphics and Modelling"},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1002\/cmdc.200700075","volume":"2","author":"G. Klebe","year":"2007","unstructured":"Klebe, G., Hulemeirer, E., Weskamp, N., Khun, D.: Functional classification of protein kinase binding sites using cavbase. ChemMedChem.\u00a02, 1432\u20131447 (2007)","journal-title":"ChemMedChem."},{"issue":"4","key":"54_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/347057.347412","volume":"30","author":"B. Krishnamurthy","year":"2000","unstructured":"Krishnamurthy, B., Wang, J.: On network-aware clustering of web clients. SIGCOMM Comput. Commun. Rev.\u00a030(4), 97\u2013110 (2000)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review\u00a069, 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"issue":"3","key":"54_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jbiotec.2011.12.005","volume":"159","author":"B. Nisius","year":"2012","unstructured":"Nisius, B., Sha, F., Gohlke, H.: Structure-based computational analysis of protein binding sites for function and druggability prediction. Journal of Biotechnology\u00a0159(3), 123\u2013134 (2012)","journal-title":"Journal of Biotechnology"},{"issue":"2","key":"54_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1021\/ci010381f","volume":"42","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. Journal of Chemical Information and Computer Sciences\u00a042(2), 305\u2013316 (2002)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design\u00a016, 521\u2013533 (2002)","journal-title":"Journal of Computer-Aided Molecular Design"},{"key":"54_CR16","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1073\/pnas.0237338100","volume":"100","author":"A.W. Rives","year":"2003","unstructured":"Rives, A.W., Galitski, T.: Modular organization of cellular networks. Proc. Natl. Acad.\u00a0100, 1128\u20131133 (2003)","journal-title":"Proc. Natl. Acad."},{"key":"54_CR17","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.\u00a0323, 387\u2013406 (2002)","journal-title":"J. Mol. Biol."},{"key":"54_CR18","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/2487575.2487645","volume-title":"Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013","author":"C. Tsourakakis","year":"2013","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, pp. 104\u2013112. ACM, New York (2013)"},{"issue":"2","key":"54_CR19","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. Bioinformatics\u00a04(2), 310\u2013320 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"10","key":"54_CR20","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1093\/bioinformatics\/bth113","volume":"20","author":"N. Weskamp","year":"2004","unstructured":"Weskamp, N., Kuhn, D., Hullermeier, E., Klebe, G.: Efficient similarity search in protein structure databases by k-clique hashing. Bioinformatics\u00a020(10), 1522\u20131526 (2004)","journal-title":"Bioinformatics"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems'2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11310-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T22:02:24Z","timestamp":1676412144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11310-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319113098","9783319113104"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11310-4_54","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}