{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:39:04Z","timestamp":1743115144406,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319000343"},{"type":"electronic","value":"9783319000350"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-00035-0_28","type":"book-chapter","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T09:29:53Z","timestamp":1377595793000},"page":"279-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Local Clique Merging: An Extension of the Maximum Common Subgraph Measure with Applications in Structural Bioinformatics"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Fober","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Klebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,16]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Boukhris,\u00a0I., Elouedi,\u00a0Z., Fober,\u00a0T., Mernberger,\u00a0M., & \u00a0H\u00fcllermeier, E. (2009). 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, Pisa, Italy (pp. 1245\u20131250).","DOI":"10.1109\/ISDA.2009.75"},{"issue":"3\u20134","key":"28_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., & Shearer, K. (1998). A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3\u20134), 255\u2013259.","journal-title":"Pattern Recognition Letters"},{"issue":"6","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1109\/TCBB.2011.42","volume":"8","author":"T. Fober","year":"2011","unstructured":"Fober, T., Glinca, S., Klebe, G., H\u00fcllermeier, E. (2011). Superposition and alignment of labeled point clouds. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 8(6), 1653\u20131666.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of Computer Computations (pp. 85\u2013103). New York: Plenum Press"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1016\/j.jmb.2006.04.024","volume":"359","author":"D. Kuhn","year":"2006","unstructured":"Kuhn, D., Weskamp, N., Schmitt, S., H\u00fcllermeier, E., Klebe, G. (2006). From the similarity analysis of protein cavities to the functional classification of protein families using cavbase. Journal of Molecular Biology, 359(4), 1023\u20131044.","journal-title":"Journal of Molecular Biology"},{"issue":"1972","key":"28_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G. Levi","year":"1973","unstructured":"Levi, G. (1973) A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9(1972), 341\u2013352.","journal-title":"Calcolo"},{"issue":"2","key":"28_CR7","first-page":"260","volume":"16","author":"X.-L. Li","year":"2005","unstructured":"Li, X.-L., Tan, S.-H., Foo, C.-S., & Ng, S.-K. (2005) Interaction graph mining for protein complexes using local clique merging. Genome Informatics, 16(2), 260\u2013269.","journal-title":"Genome Informatics"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Liu,\u00a0G., & Wong,\u00a0L. (2008). Effective pruning techniques for mining quasi-cliques. In European conference on machine learning and principles and practice of knowledge discovery in databases, part II, Antwerp, Belgium (pp. 33\u201349).","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"28_CR9","volume-title":"Paradigms of artificial intelligence programming","author":"P. Norvig","year":"1991","unstructured":"Norvig, P. (1991) Paradigms of artificial intelligence programming. Burlington: Morgan Kaufmann"},{"issue":"2","key":"28_CR10","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. (2002) A new method to detect related function among proteins independent of sequence and fold homology. Journal of Molecular Biology, 323(2), 387\u2013406.","journal-title":"Journal of Molecular Biology"}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Algorithms from and for Nature and Life"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00035-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:32:40Z","timestamp":1676820760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00035-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319000343","9783319000350"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00035-0_28","relation":{},"ISSN":["1431-8814"],"issn-type":[{"type":"print","value":"1431-8814"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"16 July 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}