Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
A lock-and-key model for protein--protein interactions
Bioinformatics
Near optimal solutions for maximum quasi-bicliques
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Algorithms for induced biclique optimization problems
Information Processing Letters
Computing the protein binding sites
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Mining biological interaction networks using weighted quasi-bicliques
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mining from protein–protein interactions
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Identification of DNA-Binding and Protein-Binding Proteins Using Enhanced Graph Wavelet Features
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hi-index | 0.00 |
HASH(0x2973610)