Sampling strategy for protein complex prediction using cluster size frequency

In this paper we propose a Markov chain Monte Carlo sampling method for predicting protein complexes from protein–protein interactions (PPIs). Many of the existing tools for this problem are designed more or less based on a density measure of a subgraph of the PPI network. This kind of measures is less effective for smaller complexes. On the other hand, it can be found that the number of complexes of a size in a database of protein complexes follows a power-law. Thus, most of the complexes are small-sized. For example, in CYC2008, a database of curated protein complexes of yeast, 42% of the complexes are heterodimeric, i.e., a complex consisting of two different proteins. In this work, we propose a protein complex prediction algorithm, called PPSampler (Proteins' Partition Sampler), which is designed based on the Metropolis–Hastings algorithm using a parameter representing a target value of the relative frequency of the number of predicted protein complexes of a particular size. In a performance comparison, PPSampler outperforms other existing algorithms. Furthermore, about half of the predicted clusters that are not matched with any known complexes in CYC2008 are statistically significant by Gene Ontology terms. Some of them can be expected to be true complexes.