By Topic

Dynamic Load Balancing for Mining of Molecular Structures using Genetic Algorithm

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)
Masum, S.M. ; Univ. of Memphis, Memphis ; Yeasin, M.

Graph mining techniques for analyzing large collections of molecules to find regularity or patterns among molecules of a specific class, such as finding common properties in large numbers of drug candidates, finding molecular features that inhibit the desired reaction etc. is an important research issue in bioinformatics as well as molecular informatics. In this context, finding frequent graphs has received increasing attention over the past years. But, the computational complexity of the underlying problem and the large amount of data to be explored essentially render traditional sequential algorithms practically useless. To address such problems a distributed algorithm is adopted to find the frequent sub-graphs and to discover interesting patterns in molecular compounds. However, this problem is characterized by a highly irregular search tree, whereby reliable workload prediction is very hard. Therefore, a genetic algorithm (GA) is proposed to solve the dynamic load-balancing problem of highly irregular search tree.

Published in:

Bioinformatics and Bioengineering, 2007. BIBE 2007. Proceedings of the 7th IEEE International Conference on

Date of Conference:

14-17 Oct. 2007