{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:59:16Z","timestamp":1725861556054},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_46","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"573-584","source":"Crossref","is-referenced-by-count":0,"title":["Highly Bi-Connected Subgraphs for Computational Protein Function Annotation"],"prefix":"10.1007","author":[{"given":"Jucheol","family":"Moon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iddo","family":"Friedberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Eulenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"issue":"9","key":"46_CR1","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1093\/bioinformatics\/btm064","volume":"23","author":"B Andreopoulos","year":"2007","unstructured":"Andreopoulos, B., An, A., Wang, X., Faloutsos, M., Schroeder, M.: Clustering by common friends finds locally significant proteins mediating modules. Bioinformatics 23(9), 1124\u20131131 (2007)","journal-title":"Bioinformatics"},{"issue":"1","key":"46_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"M Ashburner","year":"2000","unstructured":"Ashburner, M., Ball, C.A., Blake, J.A., Botstein, D., Butler, H., Cherry, J.M., Davis, A.P., Dolinski, K., et al.: Gene ontology: tool for the unification of biology. Nat. Genet. 25(1), 25\u201329 (2000)","journal-title":"Nat. Genet."},{"issue":"9","key":"46_CR3","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"B Dongbo","year":"2003","unstructured":"Dongbo, B., Zhao, Y., Cai, L., Xue, H., Zhu, X., Hongchao, L., Zhang, J., et al.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"10","key":"46_CR4","doi-asserted-by":"crossref","first-page":"S16","DOI":"10.1186\/1471-2105-13-S10-S16","volume":"13","author":"W-C Chang","year":"2012","unstructured":"Chang, W.-C., Vakati, S., Krause, R., Eulenstein, O.: Exploring biological interaction networks with tailored weighted quasi-bicliques. BMC Bioinform. 13(10), S16 (2012)","journal-title":"BMC Bioinform."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"UniProt Consortium, et al.: Uniprot: a hub for protein information. Nucleic Acids Res. 43, 989 (2014)","DOI":"10.1093\/nar\/gku989"},{"key":"46_CR6","first-page":"270","volume":"40","author":"P Dankelmann","year":"1995","unstructured":"Dankelmann, P., Volkmann, L.: New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Combinatoria 40, 270\u2013278 (1995)","journal-title":"Ars Combinatoria"},{"issue":"3","key":"46_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1093\/bib\/bbl004","volume":"7","author":"I Friedberg","year":"2006","unstructured":"Friedberg, I.: Automated protein function prediction the genomic challenge. Briefings Bioinform. 7(3), 225\u2013242 (2006)","journal-title":"Briefings Bioinform."},{"issue":"1","key":"46_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1093\/bioinformatics\/btq652","volume":"27","author":"G Geva","year":"2011","unstructured":"Geva, G., Sharan, R.: Identification of protein complexes from co-immunoprecipitation data. Bioinformatics 27(1), 111\u2013117 (2011)","journal-title":"Bioinformatics"},{"issue":"3","key":"46_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1006\/geno.2000.6187","volume":"66","author":"E Hartuv","year":"2000","unstructured":"Hartuv, E., Schmitt, A.O., Lange, J., Meier-Ewert, S., Lehrach, H., Shamir, R.: An algorithm for clustering cDNA fingerprints. Genomics 66(3), 249\u2013256 (2000)","journal-title":"Genomics"},{"issue":"4","key":"46_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E Hartuv","year":"2000","unstructured":"Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Inf. Process. Lett. 76(4), 175\u2013181 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"46_CR11","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCBB.2013.177","volume":"11","author":"F H\u00fcffner","year":"2014","unstructured":"H\u00fcffner, F., Komusiewicz, C., Liebtrau, A., Niedermeier, R.: Partitioning biological networks into highly connected clusters with maximum edge coverage. IEEE\/ACM Trans. Comput. Biol. Bioinf. (TCBB) 11(3), 455\u2013467 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf. (TCBB)"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-662-46078-8_21","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science-Testing","author":"F H\u00fcffner","year":"2015","unstructured":"H\u00fcffner, F., Komusiewicz, C., Sorge, M.: Finding highly connected subgraphs. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015-Testing. LNCS, vol. 8939, pp. 254\u2013265. Springer, Heidelberg (2015)"},{"key":"46_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, New York (1972)"},{"issue":"3","key":"46_CR14","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1093\/bioinformatics\/btg415","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj, N., Wigle, D.A., Jurisica, I.: Functional topology in a network of protein interactions. Bioinformatics 20(3), 340\u2013348 (2004)","journal-title":"Bioinformatics"},{"issue":"3","key":"46_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1038\/nmeth.2340","volume":"10","author":"P Radivojac","year":"2013","unstructured":"Radivojac, P., Clark, W.T., Oron, T.R., Schnoes, A.M., Wittkop, T., Sokolov, A., Graim, K., Funk, C., Verspoor, K., Ben-Hur, A., et al.: A large-scale evaluation of computational protein function prediction. Nat. Methods 10(3), 221\u2013227 (2013)","journal-title":"Nat. Methods"},{"issue":"4","key":"46_CR16","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tibtech.2009.01.002","volume":"27","author":"R Rentzsch","year":"2009","unstructured":"Rentzsch, R., Orengo, C.A.: Protein function prediction-the power of multiplicity. Trends Biotechnol. 27(4), 210\u2013219 (2009)","journal-title":"Trends Biotechnol."},{"issue":"1","key":"46_CR17","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1038\/msb4100129","volume":"3","author":"R Sharan","year":"2007","unstructured":"Sharan, R., Ulitsky, I., Shamir, R.: Network-based prediction of protein function. Mol. Syst. Biol. 3(1), 88 (2007)","journal-title":"Mol. Syst. Biol."},{"issue":"3","key":"46_CR18","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10878-011-9392-4","volume":"25","author":"L Wang","year":"2013","unstructured":"Wang, L.: Near optimal solutions for maximum quasi-bicliques. J. Comb. Optim. 25(3), 481\u2013497 (2013)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T11:04:52Z","timestamp":1568199892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}