Ultra-large library screening with an evolutionary algorithm in Rosetta (REvoLd)
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908700590997504 |
|---|---|
| author | Eisenhuth, Paul Liessmann, Fabian Moretti, Rocco Meiler, Jens |
| author_facet | Eisenhuth, Paul Liessmann, Fabian Moretti, Rocco Meiler, Jens |
| contents | Ultra-large make-on-demand compound libraries now contain billions of readily available compounds. This represents a golden opportunity for in-silico drug discovery. One challenge, however, is the time and computational cost of an exhaustive screen of such large libraries when receptor flexibility is taken into account. We propose an evolutionary algorithm to search combinatorial make-on-demand chemical space efficiently without enumerating all molecules. We exploit the feature of make-on-demand compound libraries, namely that they are constructed from lists of substrates and chemical reactions. Our algorithm RosettaEvolutionaryLigand (REvoLd) explores the vast search space of combinatorial libraries for protein-ligand docking with full ligand and receptor flexibility through RosettaLigand. A benchmark of REvoLd on five drug targets showed improvements in hit rates by factors between 869 and 1622 compared to random selections. REvoLd is available as an application within the Rosetta software suite (https://docs.rosettacommons.org/docs/latest/revold). This work formulates an evolutionary algorithm for optimization and exploration of ultra-large make-on-demand libraries. We demonstrate that our approach results in strong and stable enrichment, offering the most efficient algorithm for drug discovery in ultra-large chemical space to date. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_17329 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Ultra-large library screening with an evolutionary algorithm in Rosetta (REvoLd) Eisenhuth, Paul Liessmann, Fabian Moretti, Rocco Meiler, Jens Quantitative Methods Ultra-large make-on-demand compound libraries now contain billions of readily available compounds. This represents a golden opportunity for in-silico drug discovery. One challenge, however, is the time and computational cost of an exhaustive screen of such large libraries when receptor flexibility is taken into account. We propose an evolutionary algorithm to search combinatorial make-on-demand chemical space efficiently without enumerating all molecules. We exploit the feature of make-on-demand compound libraries, namely that they are constructed from lists of substrates and chemical reactions. Our algorithm RosettaEvolutionaryLigand (REvoLd) explores the vast search space of combinatorial libraries for protein-ligand docking with full ligand and receptor flexibility through RosettaLigand. A benchmark of REvoLd on five drug targets showed improvements in hit rates by factors between 869 and 1622 compared to random selections. REvoLd is available as an application within the Rosetta software suite (https://docs.rosettacommons.org/docs/latest/revold). This work formulates an evolutionary algorithm for optimization and exploration of ultra-large make-on-demand libraries. We demonstrate that our approach results in strong and stable enrichment, offering the most efficient algorithm for drug discovery in ultra-large chemical space to date. |
| title | Ultra-large library screening with an evolutionary algorithm in Rosetta (REvoLd) |
| topic | Quantitative Methods |
| url | https://arxiv.org/abs/2404.17329 |