Cart (Loading....) | Create Account
Close category search window
 

Ant Colony Optimization for optimal path finding in 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
$31 $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)
Sallim, J. ; Sch. of Comput. Sci., Univ. Sains Malaysia, Minden ; Abdullah, R. ; Khader, A.T.

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.

Published in:

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

Date of Conference:

21-22 Oct. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.