The Community for Technology Leaders
Green Image
Issue No. 04 - July/August (2011 vol. 8)
ISSN: 1545-5963
pp: 987-1003
Weimin Luo , The Hong Kong Polytechnic University, Hong Kong
Samuel S.Y. Wong , The Hong Kong Polytechnic University, Hong Kong
Keith C.C. Chan , The Hong Kong Polytechnic University, Hong Kong
ABSTRACT
Traditionally, Computer-Aided Molecular Design (CAMD) uses heuristic search and mathematical programming to tackle the molecular design problem. But these techniques do not handle large and nonlinear search space very well. To overcome these drawbacks, graph-based evolutionary algorithms (EAs) have been proposed to evolve molecular design by mimicking chemical reactions on the exchange of chemical bonds and components between molecules. For these EAs to perform their tasks, known molecular components, which can serve as building blocks for the molecules to be designed, and known chemical rules, which govern chemical combination between different components, have to be introduced before the evolutionary process can take place. To automate molecular design without these constraints, this paper proposes an EA called Evolutionary Algorithm for Molecular Design (EvoMD). EvoMD encodes molecular designs in graphs. It uses a novel crossover operator which does not require known chemistry rules known in advanced and it uses a set of novel mutation operators. EvoMD uses atomics-based and fragment-based approaches to handle different size of molecule, and the value of the fitness function it uses is made to depend on the property descriptors of the design encoded in a molecular graph. It has been tested with different data sets and has been shown to be very promising.
INDEX TERMS
Evolutionary algorithm, genetic algorithm, Number-of-Vertices mutation, Number-of-Edge mutation, random graph crossover, Swap-Vertex mutation, uniform crossover.
CITATION
Weimin Luo, Samuel S.Y. Wong, Keith C.C. Chan, "EvoMD: An Algorithm for Evolutionary Molecular Design", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. , pp. 987-1003, July/August 2011, doi:10.1109/TCBB.2010.100
99 ms
(Ver 3.1 (10032016))