Iterative Cluster Analysis of Protein Interaction Data
Bioinformatics
ACOPIN: An ACO Algorithm with TSP Approach for Clustering Proteins from Protein Interaction Network
EMS '08 Proceedings of the 2008 Second UKSIM European Symposium on Computer Modeling and Simulation
Protein Interaction Networks: Computational Analysis
Protein Interaction Networks: Computational Analysis
Bootstrapping the interactome: unsupervised identification of protein complexes in yeast
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A multiagent genetic algorithm for global numerical optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Functional module identification in a Protein-Protein Interaction (PPI) network is one of the most important and challenging tasks in computational biology. For detecting functional modules, it is difficult to solve the problem directly and always results in a low accuracy and a large discard rate. In this paper, we present a novel algorithm of ant colony optimization with multi-agent evolution for detecting functional modules. The proposed ACO-MAE algorithm enhances the performance of ant colony optimization (ACO) by incorporating multi-agent evolution (MAE). First, the ant colony optimization for solving Traveling Salesman Problems (TSP) is conducted to construct primary clustering results. Then, the multi-agent evolutionary process is performed to move out of local optima. From simulation results, it is shown that the proposed ACO-MAE algorithm has superior performance when compared to other existing algorithms.