Skip to main content
  • Poster presentation
  • Open access
  • Published:

Knowledge-driven multi-objective de novodrug design

Drug discovery is an inherently multi-objective process since drugs need to satisfy not only activity requirements but also a range of other properties such as selectivity and toxicity. However, drug discovery process practices, including both experimental and computational methods, commonly ignore this fact and focus on a single pharmaceutical objective at a time. De novo design, the branch of chemoinformatics addressing the in silico design of ligands from scratch, follows a similar approach typically focusing on a single objective, such as an interaction score to a target receptor or similarity to a known drug [1]. Recently, methods have appeared in the literature that attempt to design molecules satisfying multiple predefined objectives [2]. Motivated from the initial success of these algorithms [3] – as well as their widespread use in other scientific fields – we have preciously introduced MEGA, a Multi-objective Evolutionary Graph Algorithm with the aim of performing de novo design taking into account numerous pharmaceutically relevant objectives. Unlike most other evolutionary-based de novo algorithms, MEGA uses graph data structures for chromosome representation and directly manipulates the graphs to perform a global search for promising solutions. The initial version of the algorithm includes problem-domain specific knowledge in the form of weighted molecular fragments used during chemical structure evolution. Capitalizing on lessons learned we have designed an extension blending additional problem knowledge and local search capabilities to achieve faster convergence. This type of algorithm, commonly referred to as Memetic in the optimization community, has been shown to be orders of magnitude faster than traditional evolutionary algorithms [4] especially in problems searching large, complex and multimodal solution surfaces.

In our presentation we initially outline the key elements of the implementation of our algorithm. Following, we present results from the application of the memetic version of MEGA to design molecules that satisfy multiple objectives. Several test cases have been examined, including selectivity between targets and compromising similarity to a drug and drug-likeness. The results show that the inclusion of domain specific knowledge has a positive impact and should in principle be exploited since it facilitates the practical use of methods incorporating multi-objective de novo design.

References

  1. Schneider G, Fechner U: Computer-based de novo design of druglike molecules. Nat Rev Drug Discov. 2005, 4 (8): 649-663. 10.1038/nrd1799.

    Article  CAS  Google Scholar 

  2. Brown N, McKay B, Gilardoni F, Gasteiger J: A graph-based genetic algorithm and its application to the multiobjective evolution of median molecules. J Chem Inf Comput Sci. 2004, 44 (3): 1079-1087.

    Article  CAS  Google Scholar 

  3. Nicolaou CA, Brown N, Pattichis C: Molecular optimization using computational multi-objective methods. Curr Opin Drug Discov. 2007, 10 (3): 316-24.

    CAS  Google Scholar 

  4. Merz P: Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms. Evolutionary Computation. 2004, 12 (3): 303-325. 10.1162/1063656041774956.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Nicolaou, C., Kannas, C. & Pattichis, C. Knowledge-driven multi-objective de novodrug design. Chemistry Central Journal 3 (Suppl 1), P22 (2009). https://doi.org/10.1186/1752-153X-3-S1-P22

Download citation

  • Published:

  • DOI: https://doi.org/10.1186/1752-153X-3-S1-P22

Keywords