By Topic

ACOPIN: An ACO Algorithm with TSP Approach for Clustering Proteins from Protein Interaction Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jamaludin Sallim ; Sch. of Comput. Sci., Univ. Sains Malaysia, Penang ; Rosni Abdullah ; Ahamad Tajudin Khader

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.

Published in:

Computer Modeling and Simulation, 2008. EMS '08. Second UKSIM European Symposium on

Date of Conference:

8-10 Sept. 2008