k-partite cliques of protein interactions: a novel subgraph topology for functional coherence analysis on PPI networks
DOI10.1016/J.JTBI.2013.09.013zbMATH Open1411.92101OpenAlexW2049400719WikidataQ51161537 ScholiaQ51161537MaRDI QIDQ2632355FDOQ2632355
Authors: Qian Liu, Yi-Ping Phoebe Chen, Jinyan (Leo) Li 
Publication date: 14 May 2019
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jtbi.2013.09.013
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
\(\mathcal{K}\)-partite graphs\(k\)-partite protein cliquesmaximal \(k\)-partite cliqueprotein functional coherence
Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Systems biology, networks (92C42) Software, source code, etc. for problems pertaining to biology (92-04)
Cites Work
- 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
- Semantic and layered protein function prediction from PPI networks
- Bio-entity network for analysis of protein-protein interaction networks
Cited In (3)
Uses Software
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)
