{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:56:04Z","timestamp":1742932564637,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030320461"},{"type":"electronic","value":"9783030320478"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-32047-8_27","type":"book-chapter","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T05:07:22Z","timestamp":1569301642000},"page":"308-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Protein Complex Similarity Based on Weisfeiler-Lehman Labeling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5263-2358","authenticated-orcid":false,"given":"Bianca K.","family":"St\u00f6cker","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1709-1925","authenticated-orcid":false,"given":"Till","family":"Sch\u00e4fer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7621-971X","authenticated-orcid":false,"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9818-9320","authenticated-orcid":false,"given":"Johannes","family":"K\u00f6ster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2645-947X","authenticated-orcid":false,"given":"Nils","family":"Kriege","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8536-6065","authenticated-orcid":false,"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-22177-9_26","volume-title":"Fundamentals of Computation Theory","author":"V Arvind","year":"2015","unstructured":"Arvind, V., K\u00f6bler, J., Rattan, G., Verbitsky, O.: On the power of color refinement. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 339\u2013350. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22177-9_26"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Kucera, L.: Canonical labelling of graphs in linear average time. In: 20th Annual Symposium on Foundations of Computer Science (SFCS), pp. 39\u201346. IEEE (1979)","DOI":"10.1109\/SFCS.1979.8"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1109\/TKDE.2015.2492559","volume":"28","author":"SS Bhowmick","year":"2016","unstructured":"Bhowmick, S.S., Seah, B.: Clustering and summarizing protein-protein interaction networks: a survey. IEEE Trans. Knowl. Data Eng. 28(3), 638\u2013658 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1016\/j.cell.2015.11.007","volume":"163","author":"M Boutros","year":"2015","unstructured":"Boutros, M., Heigwer, F., Laufer, C.: Microscopy-based high-content screening. Cell 163(6), 1314\u20131325 (2015)","journal-title":"Cell"},{"issue":"8","key":"27_CR5","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett. 18(8), 689\u2013694 (1997)","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"27_CR6","doi-asserted-by":"publisher","first-page":"932","DOI":"10.15252\/msb.20167490","volume":"13","author":"K Drew","year":"2017","unstructured":"Drew, K., et al.: Integration of over 9,000 mass spectrometry experiments builds a global map of human protein complexes. Mol. Syst. Biol. 13(6), 932 (2017)","journal-title":"Mol. Syst. Biol."},{"key":"27_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"8","key":"27_CR8","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1002\/cyto.a.22876","volume":"89","author":"HE Grecco","year":"2016","unstructured":"Grecco, H.E., Imtiaz, S., Zamir, E.: Multiplexed imaging of intracellular protein networks. Cytometry A 89(8), 761\u2013775 (2016)","journal-title":"Cytometry A"},{"issue":"9","key":"27_CR9","doi-asserted-by":"publisher","first-page":"e0183460","DOI":"10.1371\/journal.pone.0183460","volume":"12","author":"C Hernandez","year":"2017","unstructured":"Hernandez, C., Mella, C., Navarro, G., Olivera-Nappa, A., Araya, J.: Protein complex prediction via dense subgraphs and false positive analysis. PLoS ONE 12(9), e0183460 (2017)","journal-title":"PLoS ONE"},{"key":"27_CR10","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). https:\/\/doi.org\/10.1007\/3-540-55210-3_198"},{"issue":"19","key":"27_CR11","doi-asserted-by":"publisher","first-page":"2520","DOI":"10.1093\/bioinformatics\/bts480","volume":"28","author":"J K\u00f6ster","year":"2012","unstructured":"K\u00f6ster, J., Rahmann, S.: Snakemake - a scalable bioinformatics workflow engine. Bioinformatics 28(19), 2520\u20132522 (2012)","journal-title":"Bioinformatics"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1038\/nprot.2016.169","volume":"12","author":"D Kozakov","year":"2017","unstructured":"Kozakov, D., Hall, D.R., Xia, B., Porter, K.A., Padhorny, D., Yueh, C., Beglov, D., Vajda, S.: The ClusPro web server for protein-protein docking. Nat. Protoc. 12(2), 255\u2013278 (2017)","journal-title":"Nat. Protoc."},{"issue":"11","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.1016\/j.febslet.2009.03.019","volume":"583","author":"RA Laskowski","year":"2009","unstructured":"Laskowski, R.A., Gerick, F., Thornton, J.M.: The structural basis of allosteric regulation in proteins. FEBS Lett. 583(11), 1692\u20131698 (2009)","journal-title":"FEBS Lett."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.patcog.2017.07.029","volume":"72","author":"J Lerouge","year":"2017","unstructured":"Lerouge, J., Abu-Aisheh, Z., Raveaux, R., H\u00e9roux, P., Adam, S.: New binary linear programming formulation to compute the graph edit distance. Pattern Recogn. 72, 254\u2013265 (2017)","journal-title":"Pattern Recogn."},{"issue":"Suppl 1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"S6","DOI":"10.1186\/1752-0509-6-S1-S6","volume":"6","author":"X Ma","year":"2012","unstructured":"Ma, X., Gao, L.: Discovering protein complexes in protein interaction networks via exploring the weak ties effect. BMC Syst. Biol. 6(Suppl 1), S6 (2012)","journal-title":"BMC Syst. Biol."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.sbi.2015.08.001","volume":"35","author":"H Park","year":"2015","unstructured":"Park, H., Lee, H., Seok, C.: High-resolution protein-protein docking by global optimization: recent advances and future challenges. Curr. Opin. Struct. Biol. 35, 24\u201331 (2015)","journal-title":"Curr. Opin. Struct. Biol."},{"key":"27_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/0471250953.bi0305s43","volume":"43","author":"WR Pearson","year":"2013","unstructured":"Pearson, W.R.: Selecting the right similarity-scoring matrix. Curr. Protoc. Bioinform. 43, 1\u20139 (2013)","journal-title":"Curr. Protoc. Bioinform."},{"issue":"Suppl 12","key":"27_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1186\/s12859-016-1191-6","volume":"17","author":"M Pellegrini","year":"2016","unstructured":"Pellegrini, M., Baglioni, M., Geraci, F.: Protein complex prediction for large protein protein interaction networks with the Core&Peel method. BMC Bioinform. 17(Suppl 12), 372 (2016)","journal-title":"BMC Bioinform."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Riesen, K., Ferrer, M., Bunke, H.: Approximate graph edit distance in quadratic time. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2015) (epub ahead of print)","DOI":"10.1007\/978-3-319-18224-7_1"},{"issue":"suppl 1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"D497","DOI":"10.1093\/nar\/gkp914","volume":"38","author":"A Ruepp","year":"2010","unstructured":"Ruepp, A., et al.: CORUM: the comprehensive resource of mammalian protein complexes - 2009. Nucleic Acids Res. 38(suppl 1), D497\u2013D501 (2010)","journal-title":"Nucleic Acids Res."},{"issue":"6","key":"27_CR21","doi-asserted-by":"publisher","first-page":"e38765","DOI":"10.1371\/journal.pone.0038765","volume":"7","author":"C S\u00e1nchez Claros","year":"2012","unstructured":"S\u00e1nchez Claros, C., Tramontano, A.: Detecting mutually exclusive interactions in protein-protein interaction maps. PLoS ONE 7(6), e38765 (2012)","journal-title":"PLoS ONE"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"27_CR23","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"27_CR24","doi-asserted-by":"publisher","DOI":"10.1145\/3064650","volume-title":"Computational Prediction of Protein Complexes from Protein Interaction Networks","author":"S Srihari","year":"2017","unstructured":"Srihari, S., Yong, C.H., Wong, L.: Computational Prediction of Protein Complexes from Protein Interaction Networks. Association for Computing Machinery and Morgan & Claypool, New York (2017)"},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1039\/C8IB00012C","volume":"10","author":"BK St\u00f6cker","year":"2018","unstructured":"St\u00f6cker, B.K., K\u00f6ster, J., Zamir, E., Rahmann, S.: Modeling and simulating networks of interdependent protein interactions. Integr. Biol. 10, 290\u2013305 (2018)","journal-title":"Integr. Biol."},{"key":"27_CR26","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"27_CR27","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1038\/nbt.3146","volume":"33","author":"M Wachsmuth","year":"2015","unstructured":"Wachsmuth, M., Conrad, C., Bulkescher, J., Koch, B., Mahen, R., Isokane, M., Pepperkok, R., Ellenberg, J.: High-throughput fluorescence correlation spectroscopy enables analysis of proteome dynamics in living cells. Nat. Biotechnol. 33(4), 384\u2013389 (2015)","journal-title":"Nat. Biotechnol."},{"issue":"9","key":"27_CR28","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Lehman, A.A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsiya 2(9), 12\u201316 (1968). (in Russian)","journal-title":"Nauchno-Technicheskaya Informatsiya"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32047-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:47:05Z","timestamp":1710326825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-32047-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030320461","9783030320478"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32047-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newark, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.88","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-92","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}