Prediction of problematic complexes from PPI networks: Sparse, embedded, and small complexes

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

The prediction of protein complexes from high-throughput protein-protein interaction (PPI) data remains an important challenge in bioinformatics. Three groups of complexes have been identified as problematic to discover. First, many complexes are sparsely connected in the PPI network, and do not form dense clusters that can be derived by clustering algorithms. Second, many complexes are embedded within highly-connected regions of the PPI network, which makes it difficult to accurately delimit their boundaries. Third, many complexes are small (composed of two or three distinct proteins), so that traditional topological markers such as density are ineffective.

Cite

CITATION STYLE

APA

Yong, C. H., & Wong, L. (2015). Prediction of problematic complexes from PPI networks: Sparse, embedded, and small complexes. Biology Direct, 10(1). https://doi.org/10.1186/s13062-015-0067-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free