MFC: Mining Maximal Frequent Dense Subgraphs Without Candidate Maintenance in Imbalanced PPI Networks

The prediction of protein function is one of the most challenging problems in bioinformatics. Several studies have shown that the prediction using PPI is promising. However, the PPI data generated from high-throughput experiments are very noisy, which renders great challenges to the existing methods. In this paper, the authors propose an algorithm, MFC, to efficiently mine maximal frequent dense subgraphs without candidate maintenance in PPI networks. Instead of using summary graph, MFC produces frequent dense patterns by extending vertices. It adopts several techniques to achieve efficient mining.

Provided by: Academy Publisher Topic: Software Date Added: Mar 2011 Format: PDF

Find By Topic