On the Design of Optimization Algorithms for Prediction of Molecular Interactions

摘要

This article presents a comprehensive study on the main characteristics of a novel optimization algorithm specifically designed for simulation of protein-ligand interactions. Though design of optimization algorithms has been a research issue extensively studied by computer scientists for decades, the emerging applications in bioinformatics such as simulation of protein-ligand interactions and protein folding introduce additional challenges due to (1) the high dimensionality nature of the problem and (2) the highly rugged landscape of the energy function. As a result, optimization algorithms that are not carefully designed to tackle these two challenges may fail to deliver satisfactory performance. This study has been motivated by the observation that the RAME (Rank-based Adaptive Mutation Evolutionary) optimization algorithm specifically designed for simulation of protein-ligand docking has consistently outperformed the conventional optimization algorithms by a significant degree. Accordingly, it is of interest to conduct a comprehensive investigation on the characteristics of the proposed algorithm and to learn how it will perform in the more general cases. The experimental results reveal that the RAME algorithm proposed in this article is capable of delivering superior performance to several alternative versions of the genetic algorithm in handling highly-rugged functions in the high-dimensional vector space. This article also reports experiments conducted to analyze the causes of the observed performance difference. The experiences learned provide valuable clues for how the proposed algorithm can be effectively exploited to tackle other computational biology problems.