Title | ||
---|---|---|
ACOPIN: An ACO Algorithm with TSP Approach for Clustering Proteins from Protein Interaction Network |
Abstract | ||
---|---|---|
In this paper, we proposed an Ant Colony Optimization (ACO) algorithm together with Traveling Salesman Problem (TSP) approach to investigate the clustering problem in Protein Interaction Networks (PIN). We named this combination as ACOPIN. The purpose of this work is two-fold. First, to test the efficacy of ACO in clustering PIN and second, to propose the simple generalization of the ACO algorithm that might allow its application in clustering proteins in PIN. We split this paper to three mainsections. First, we describe the PIN and clustering proteins in PIN. Second, we discuss the steps involved in each phase of ACO algorithm. Finally, we present some results of the investigation with the clustering patterns. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/EMS.2008.94 | EMS |
Keywords | Field | DocType |
ant colony optimization,clustering pattern,clustering protein,clustering pin,aco algorithm,clustering proteins,tsp approach,simple generalization,salesman problem,protein interaction networks,clustering problem,clustering algorithms,traveling salesman problem,ontologies,proteins,organisms,optimization,biology | Ant colony optimization algorithms,Distance measurement,Protein Interaction Networks,Combinatorial optimization problem,Correlation clustering,Algorithm,Interaction network,Travelling salesman problem,Cluster analysis,Mathematics | Conference |
Citations | PageRank | References |
11 | 0.57 | 11 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jamaludin Sallim | 1 | 12 | 1.62 |
Rosni Abdullah | 2 | 156 | 24.82 |
Ahamad Tajudin Khader | 3 | 683 | 40.71 |