Cargando…
Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm
Generating molecules with desired properties is an important task in chemistry and pharmacy. An efficient method may have a positive impact on finding drugs to treat diseases like COVID-19. Data mining and artificial intelligence may be good ways to find an efficient method. Recently, both the gener...
Autores principales: | , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Nature Singapore
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9797891/ https://www.ncbi.nlm.nih.gov/pubmed/36594005 http://dx.doi.org/10.1007/s11390-021-0970-3 |
_version_ | 1784860784306683904 |
---|---|
author | Zhu, Jian-Fu Hao, Zhong-Kai Liu, Qi Yin, Yu Lu, Cheng-Qiang Huang, Zhen-Ya Chen, En-Hong |
author_facet | Zhu, Jian-Fu Hao, Zhong-Kai Liu, Qi Yin, Yu Lu, Cheng-Qiang Huang, Zhen-Ya Chen, En-Hong |
author_sort | Zhu, Jian-Fu |
collection | PubMed |
description | Generating molecules with desired properties is an important task in chemistry and pharmacy. An efficient method may have a positive impact on finding drugs to treat diseases like COVID-19. Data mining and artificial intelligence may be good ways to find an efficient method. Recently, both the generative models based on deep learning and the work based on genetic algorithms have made some progress in generating molecules and optimizing the molecule's properties. However, existing methods need to be improved in efficiency and performance. To solve these problems, we propose a method named the Chemical Genetic Algorithm for Large Molecular Space (CALM). Specifically, CALM employs a scalable and efficient molecular representation called molecular matrix. Then, we design corresponding crossover, mutation, and mask operators inspired by domain knowledge and previous studies. We apply our genetic algorithm to several tasks related to molecular property optimization and constraint molecular optimization. The results of these tasks show that our approach outperforms the other state-of-the-art deep learning and genetic algorithm methods, where the z tests performed on the results of several experiments show that our method is more than 99% likely to be significant. At the same time, based on the experimental results, we point out the insufficiency in the experimental evaluation standard which affects the fair evaluation of previous work. SUPPLEMENTARY INFORMATION: The online version contains supplementary material available at 10.1007/s11390-021-0970-3. |
format | Online Article Text |
id | pubmed-9797891 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Springer Nature Singapore |
record_format | MEDLINE/PubMed |
spelling | pubmed-97978912022-12-29 Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm Zhu, Jian-Fu Hao, Zhong-Kai Liu, Qi Yin, Yu Lu, Cheng-Qiang Huang, Zhen-Ya Chen, En-Hong J Comput Sci Technol Regular Paper Generating molecules with desired properties is an important task in chemistry and pharmacy. An efficient method may have a positive impact on finding drugs to treat diseases like COVID-19. Data mining and artificial intelligence may be good ways to find an efficient method. Recently, both the generative models based on deep learning and the work based on genetic algorithms have made some progress in generating molecules and optimizing the molecule's properties. However, existing methods need to be improved in efficiency and performance. To solve these problems, we propose a method named the Chemical Genetic Algorithm for Large Molecular Space (CALM). Specifically, CALM employs a scalable and efficient molecular representation called molecular matrix. Then, we design corresponding crossover, mutation, and mask operators inspired by domain knowledge and previous studies. We apply our genetic algorithm to several tasks related to molecular property optimization and constraint molecular optimization. The results of these tasks show that our approach outperforms the other state-of-the-art deep learning and genetic algorithm methods, where the z tests performed on the results of several experiments show that our method is more than 99% likely to be significant. At the same time, based on the experimental results, we point out the insufficiency in the experimental evaluation standard which affects the fair evaluation of previous work. SUPPLEMENTARY INFORMATION: The online version contains supplementary material available at 10.1007/s11390-021-0970-3. Springer Nature Singapore 2022-11-30 2022 /pmc/articles/PMC9797891/ /pubmed/36594005 http://dx.doi.org/10.1007/s11390-021-0970-3 Text en © Institute of Computing Technology, Chinese Academy of Sciences 2022 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic. |
spellingShingle | Regular Paper Zhu, Jian-Fu Hao, Zhong-Kai Liu, Qi Yin, Yu Lu, Cheng-Qiang Huang, Zhen-Ya Chen, En-Hong Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm |
title | Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm |
title_full | Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm |
title_fullStr | Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm |
title_full_unstemmed | Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm |
title_short | Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm |
title_sort | towards exploring large molecular space: an efficient chemical genetic algorithm |
topic | Regular Paper |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9797891/ https://www.ncbi.nlm.nih.gov/pubmed/36594005 http://dx.doi.org/10.1007/s11390-021-0970-3 |
work_keys_str_mv | AT zhujianfu towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm AT haozhongkai towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm AT liuqi towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm AT yinyu towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm AT luchengqiang towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm AT huangzhenya towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm AT chenenhong towardsexploringlargemolecularspaceanefficientchemicalgeneticalgorithm |