Hide metadata

dc.date.accessioned2023-03-16T16:11:11Z
dc.date.available2023-03-16T16:11:11Z
dc.date.created2022-06-10T13:41:47Z
dc.date.issued2022
dc.identifier.citationVerhellen, Jonas . Graph-based molecular Pareto optimisation. Chemical Science. 2022, 13(25), 7526-7535
dc.identifier.urihttp://hdl.handle.net/10852/101521
dc.description.abstractComputer-assisted design of small molecules has experienced a resurgence in academic and industrial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfil required chemical properties is encouraging, the use of deep learning models requires significant, if not prohibitive, amounts of data and computational power. At the same time, open-sourcing of more traditional techniques such as graph-based genetic algorithms for molecular optimisation [Jensen, Chem. Sci., 2019, 12, 3567–3572] has shown that simple and training-free algorithms can be efficient and robust alternatives. Further research alleviated the common genetic algorithm issue of evolutionary stagnation by enforcing molecular diversity during optimisation [Van den Abeele, Chem. Sci., 2020, 42, 11485–11491]. The crucial lesson distilled from the simultaneous development of deep generative models and advanced genetic algorithms has been the importance of chemical space exploration [Aspuru-Guzik, Chem. Sci., 2021, 12, 7079–7090]. For single-objective optimisation problems, chemical space exploration had to be discovered as a useable resource but in multi-objective optimisation problems, an exploration of trade-offs between conflicting objectives is inherently present. In this paper we provide state-of-the-art and open-source implementations of two generations of graph-based non-dominated sorting genetic algorithms (NSGA-II, NSGA-III) for molecular multi-objective optimisation. We provide the results of a series of benchmarks for the inverse design of small molecule drugs for both the NSGA-II and NSGA-III algorithms. In addition, we introduce the dominated hypervolume and extended fingerprint based internal similarity as novel metrics for these benchmarks. By design, NSGA-II, and NSGA-III outperform a single optimisation method baseline in terms of dominated hypervolume, but remarkably our results show they do so without relying on a greater internal chemical diversity.
dc.languageEN
dc.rightsAttribution 3.0 Unported
dc.rights.urihttps://creativecommons.org/licenses/by/3.0/
dc.titleGraph-based molecular Pareto optimisation
dc.title.alternativeENEngelskEnglishGraph-based molecular Pareto optimisation
dc.typeJournal article
dc.creator.authorVerhellen, Jonas
cristin.unitcode185,15,29,0
cristin.unitnameInstitutt for biovitenskap
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode2
dc.identifier.cristin2030838
dc.identifier.bibliographiccitationinfo:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Chemical Science&rft.volume=13&rft.spage=7526&rft.date=2022
dc.identifier.jtitleChemical Science
dc.identifier.volume13
dc.identifier.issue25
dc.identifier.startpage7526
dc.identifier.endpage7535
dc.identifier.doihttps://doi.org/10.1039/d2sc00821a
dc.type.documentTidsskriftartikkel
dc.type.peerreviewedPeer reviewed
dc.source.issn2041-6520
dc.type.versionPublishedVersion


Files in this item

Appears in the following Collection

Hide metadata

Attribution 3.0 Unported
This item's license is: Attribution 3.0 Unported