{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:08Z","timestamp":1773481928882,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540697329","type":"print"},{"value":"9783540697336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_26","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"255-264","source":"Crossref","is-referenced-by-count":18,"title":["Quasi-bicliques: Complexity and Binding Pairs"],"prefix":"10.1007","author":[{"given":"Xiaowen","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jinyan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"26_CR1","doi-asserted-by":"publisher","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\u00a023(9), 1124\u20131131 (2007)","journal-title":"Bioinformatics"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1093\/nar\/29.1.37","volume":"29","author":"R. Apweiler","year":"2001","unstructured":"Apweiler, R., Attwood, T.K., Bairoch, A., Bateman, A., Birney, E., Biswas, M., Bucher, P., Cerutti, L., Corpet, F., Croning, M.D., Durbin, R., Falquet, L., Fleischmann, W., Gouzy, J., Hermjakob, H., Hulo, N., Jonassen, I., Kahn, D., Kanapin, A., Karavidopoulou, Y., Lopez, R., Marx, B., Mulder, N.J., Oinn, T.M., Pagni, M., Servant, F., Sigrist, C.J., Zdobnov, E.M.: The InterPro Database, an Integrated Documentation Resource for Protein Families, Domains and Functional Sites. Nucleic Acids Research\u00a029(1), 37\u201340 (2001)","journal-title":"Nucleic Acids Research"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1093\/protein\/7.7.841","volume":"7","author":"T.K. Attwood","year":"1994","unstructured":"Attwood, T.K., Beck, M.E.: PRINTS-a Protein Motif Fingerprint Database. Protein Engineering, Design and Selection\u00a07, 841\u2013848 (1994)","journal-title":"Protein Engineering, Design and Selection"},{"issue":"9","key":"26_CR4","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D. Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological Structure Analysis of the Protein-Protein Interaction Network in Budding Yeast. Nucleic Acids Research\u00a031(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Research"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1093\/bioinformatics\/bti011","volume":"21","author":"R.D. Finn","year":"2005","unstructured":"Finn, R.D., Marshall, M., Bateman, A.: iPfam: Visualization of Protein-Protein Interactions in PDB at Domain and Amino Acid Resolutions. Bioinformatics\u00a021(3), 410\u2013412 (2005)","journal-title":"Bioinformatics"},{"key":"26_CR6","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. Freeman, San Francisco (1979)"},{"key":"26_CR7","unstructured":"Grahne, G., Zhu, J.: Efficiently using Prefix-Trees in Mining Frequent Itemsets. In: Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI) (2003)"},{"issue":"6","key":"26_CR8","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/yea.706","volume":"18","author":"H. Hishigaki","year":"2001","unstructured":"Hishigaki, H., Nakai, K., Ono, T., Tanigami, A., Takagi, T.: Assessment of Prediction Sccuracy of Protein Gunction From Protein\u2013Protein Interaction Data. Yeast\u00a018(6), 523\u2013531 (2001)","journal-title":"Yeast"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"8","key":"26_CR10","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1093\/bioinformatics\/btl020","volume":"22","author":"H. Li","year":"2006","unstructured":"Li, H., Li, J., Wang, L.: Discovering Motif Pairs at Interaction Sites from Protein Sequences on a Proteome-Wide Scale. Bioinformatics\u00a022(8), 989\u2013996 (2006)","journal-title":"Bioinformatics"},{"issue":"16","key":"26_CR11","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1093\/bioinformatics\/btl338","volume":"22","author":"J.L. Morrison","year":"2006","unstructured":"Morrison, J.L., Breitling, R., Higham, D.J., Gilbert, D.R.: A Lock-and-Key Model for Protein-Protein Interactions. Bioinformatics\u00a022(16), 2012\u20132019 (2006)","journal-title":"Bioinformatics"},{"issue":"3","key":"26_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-Vomplete. Discrete Applied Mathematics\u00a0131(3), 651\u2013654 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"3836","DOI":"10.1093\/nar\/24.19.3836","volume":"24","author":"S. Pietrokovski","year":"1996","unstructured":"Pietrokovski, S.: Searching Databases of Conserved Sequence Regions by Aligning Protein Multiple-Alignments. Nucleic Acids Research\u00a024, 3836\u20133845 (1996)","journal-title":"Nucleic Acids Research"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/(SICI)1097-0134(199707)28:3<405::AID-PROT10>3.0.CO;2-L","volume":"28","author":"E.L.L. Sonnhammer","year":"1997","unstructured":"Sonnhammer, E.L.L., Eddy, S.R., Durbin, R.: Pfam: A Vomprehensive Database of Protein Domain Families Based on Seed Alignments. Proteins: Structure, Function and Genetics\u00a028, 405\u2013420 (1997)","journal-title":"Proteins: Structure, Function and Genetics"},{"issue":"Pt 6","key":"26_CR15","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1042\/BST0311491","volume":"31","author":"A. Thomas","year":"2003","unstructured":"Thomas, A., Cannings, R., Monk, N.A.M., Cannings, C.: On the Structure of Protein-Protein Interaction Networks. Biochemical Society Transactions\u00a031(Pt 6), 1491\u20131496 (2003)","journal-title":"Biochemical Society Transactions"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node Deletion Problems on Bipartite Graphs. SIAM Journal on Computing\u00a010, 310\u2013327 (1981)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:48Z","timestamp":1620017088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}