{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:27:21Z","timestamp":1725582441119},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21260-4_40","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T00:26:59Z","timestamp":1304036819000},"page":"428-439","source":"Crossref","is-referenced-by-count":0,"title":["Mining Biological Interaction Networks Using Weighted Quasi-Bicliques"],"prefix":"10.1007","author":[{"given":"Wen-Chieh","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudheer","family":"Vakati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Krause","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Eulenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G. Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math.\u00a0145(1), 11\u201321 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"5964","key":"40_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1126\/science.1180823","volume":"327","author":"M. Costanzo","year":"2010","unstructured":"Costanzo, M., Baryshnikova, A., Bellay, J., Kim, Y., Spear, E., Sevier, C., Ding, H., Koh, J., Toufighi, K., Mostafavi, S., et al.: The genetic landscape of a cell. Science\u00a0327(5964), 425 (2010)","journal-title":"Science"},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10479-006-0102-z","volume":"149","author":"B. Dietrich","year":"2007","unstructured":"Dietrich, B.: Some of my favorite integer programming applications at IBM. Annals of Operations Research\u00a0149(1), 75\u201380 (2007)","journal-title":"Annals of Operations Research"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Ding, C., Zhang, Y., Li, T., Holbrook, S.: Biclustering Protein Complex Interactions with a Biclique Finding Algorithm. In: ICDM, pp. 178\u2013187 (2006)","DOI":"10.1109\/ICDM.2006.27"},{"key":"40_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman, New York (1979)"},{"issue":"21","key":"40_CR6","doi-asserted-by":"publisher","first-page":"8685","DOI":"10.1073\/pnas.0701361104","volume":"104","author":"K. Goh","year":"2007","unstructured":"Goh, K., Cusick, M., Valle, D., Childs, B., Vidal, M., Barab\u00e1si, A.: The human disease network. PNAS\u00a0104(21), 8685 (2007)","journal-title":"PNAS"},{"key":"40_CR7","unstructured":"Gurobi Optimization Inc.: Gurobi Optimizer 3.0 (2010)"},{"key":"40_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"issue":"8","key":"40_CR9","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1093\/bioinformatics\/btl020","volume":"22","author":"H. Li","year":"2006","unstructured":"Li, H., Li, J., Wong, L.: Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale. Bioinformatics\u00a022(8), 989 (2006)","journal-title":"Bioinformatics"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.4236\/jbise.2008.13034","volume":"1","author":"H. Liu","year":"2008","unstructured":"Liu, H., Liu, J., Wang, L.: Searching maximum quasi-bicliques from protein-protein interaction network. JBSE\u00a01, 200\u2013203 (2008)","journal-title":"JBSE"},{"issue":"2","key":"40_CR11","first-page":"354","volume":"7","author":"X. Liu","year":"2010","unstructured":"Liu, X., Li, J., Wang, L.: Modeling protein interacting groups by quasi-bicliques: Complexity, algorithm, and application. IEEE TCBB\u00a07(2), 354\u2013364 (2010)","journal-title":"IEEE TCBB"},{"issue":"3","key":"40_CR12","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R. Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math.\u00a0131(3), 651\u2013654 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"40_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/sam.10051","volume":"2","author":"K. Sim","year":"2009","unstructured":"Sim, K., Li, J., Gopalkrishnan, V.: Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks. Analysis and Data Mining\u00a02(4), 255\u2013273 (2009)","journal-title":"Analysis and Data Mining"},{"key":"40_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/b105866","volume-title":"Proteomics and Protein-Protein Interactions Biology, Chemistry, Bioinformatics, and Drug Design","author":"G. Waksman","year":"2005","unstructured":"Waksman, G.: Proteomics and Protein-Protein Interactions Biology, Chemistry, Bioinformatics, and Drug Design. Springer, Heidelberg (2005)"},{"key":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-14031-0_44","volume-title":"Computing and Combinatorics","author":"L. Wang","year":"2010","unstructured":"Wang, L.: Near Optimal Solutions for Maximum Quasi-bicliques. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 409\u2013418. Springer, Heidelberg (2010)"},{"issue":"3","key":"40_CR16","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ympev.2005.02.008","volume":"35","author":"C. Yan","year":"2005","unstructured":"Yan, C., Burleigh, J.G., Eulenstein, O.: Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol. Phylogenet. Evol.\u00a035(3), 528\u2013535 (2005)","journal-title":"Mol. Phylogenet. Evol."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:28:10Z","timestamp":1558574890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}