k-partite cliques of protein interactions: a novel subgraph topology for functional coherence analysis on PPI networks
From MaRDI portal
Publication:2632355
Recommendations
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- Identification of functional modules in a PPI network by clique percolation clustering
- CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs
- Quasi-bicliques: Complexity and Binding Pairs
- Partitioning a PPI network into overlapping modules constrained by high-density and periphery tracking
Cites work
- Bio-entity network for analysis of protein-protein interaction networks
- Semantic and layered protein function prediction from PPI networks
- The disposition of the LZCC protein residues in wenxiang diagram provides new insights into the protein-protein interaction mechanism
- The maximum edge biclique problem is NP-complete
Cited in
(3)
This page was built for publication: \(k\)-partite cliques of protein interactions: a novel subgraph topology for functional coherence analysis on PPI networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632355)