Ant Colony Optimization for optimal path finding in protein interaction network

Author

Sallim, J. ; Abdullah, Rosni ; Khader, Ahamad Tajudin

Author_Institution

Sch. of Comput. Sci., Univ. Sains Malaysia, Minden

fYear

2008

fDate

21-22 Oct. 2008

Firstpage

41

Lastpage

44

Abstract

Recently, we have proposed ant colony optimization (ACO) algorithm together with traveling salesman problem (TSP) approach to cluster proteins in protein interaction network (PIN). Our proposal described the general adaptation of ACO to perform the clustering tasks, including the optimal path finding in PIN. In this paper, we focus precisely on the process of finding an optimal path by ACO for the given PIN.

Keywords

biology computing; molecular biophysics; proteins; travelling salesman problems; ant colony optimization; clustering tasks; optimal path finding; protein interaction network; traveling salesman problem; Ant colony optimization; Bonding; Clustering algorithms; Computational biology; Computer science; Costs; Diseases; Proposals; Proteins; Traveling salesman problems; Ant colony optimization; bond energy algorithms; optimal path finding; protein interaction network; travelling salesman problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Framework and Applications, 2008. DFmA 2008. First International Conference on

Conference_Location

Penang

Print_ISBN

978-1-4244-2312-5

Electronic_ISBN

978-1-4244-2313-2

Type

conf

DOI

10.1109/ICDFMA.2008.4784412

Filename

4784412