Abstract
AbstractLigand GA is introduced in this work and approaches the problem of finding small molecules inhibiting protein functions by using the protein site to find close to optimal or optimal small molecule binders. Genetic algorithms (GA) are an effective means for approximating or solving computationally hard mathematics problems with large search spaces such as this one. The algorithm is designed to include constraints on the generated molecules from ADME restriction, localization in a binding site, specified hydrogen bond requirements, toxicity prevention from multiple proteins, sub-structure restrictions, and database inclusion. This algorithm and work is in the context of computational modeling, ligand design and docking to protein sites.
Publisher
Springer Science and Business Media LLC
Reference68 articles.
1. Marsland, S. Machine Learning, An Algorithm Perspective 2nd edn. (Chapman and Hall, CRC, 2015). https://doi.org/10.1201/9781420067194.
2. Eberhardt, R. C. & Shi, R. C. Computational Intelligence: Concepts to Implementations (Morgan Kauffman, Elsevier, 2007) https://doi.org/10.1016/B978-155860759-0/50009-3. ISBN: 978-1-55860-759-0.
3. Goldberg, D. E. Genetic Algorithms in Search, Optimization, and Machine Learning, 13th ed. (Addison-Wesley, 1988) ISBN-13: 978–0201157673.
4. Dumitrescu, D., Beatrice Lazzerini, B. & Jain, L. C. Dumitrescu A. Evolutionary Computation, 1st ed (CRC Press, 2000) https://doi.org/10.1201/9781482273960.
5. European Consortium. Exscalate4Cov. Retrieved from EU Exscalate 4Cov Project (2021) https://www.exscalate4cov.eu/index.html.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献