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

Parallelization of the functional flow algorithm for prediction of protein function using protein-protein interaction networks

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

2 Author(s)
Akkoyun, E. ; Dept. of Med. Inf., Middle East Tech. Univ., Ankara, Turkey ; Can, T.

Protein-protein interaction networks provide important information about functions of proteins. There are various studies which analyze interaction networks and predict functions of novel proteins based on their network connectivity. However, all of these methods are sequential methods that do not utilize high performance computing. Functional flow is one of these methods that uses network connectivity, distance effect, and topology of the network with local and global views to predict protein function. With these advantages, the functional flow algorithm produces more accurate results compared to other techniques. However, due to lack of a parallelized version of the algorithm, the method cannot be practically applied on large scale networks of complex species. In this paper, we provide a parallel implementation of functional flow. We use Hadoop which is one of the open source map/reduce environments. For our experiments, we installed Hadoop on 18 hosts with eight cores each. The first map/reduce job distributes the protein interaction network as a format which allows parallel distributed computing on all the worker nodes. The other map/reduce jobs generate flows for each known protein function and the function of novel proteins are predicted by accumulating all of these generated flows. Our experiments show that the method can be distributed on worker nodes efficiently and the application can provide better performance as the number of resources increases.

Published in:

High Performance Computing and Simulation (HPCS), 2011 International Conference on

Date of Conference:

4-8 July 2011

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.