skip to main content
10.1145/3583780.3615479acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Generating Optimized Molecules without Patent Infringement

Published:21 October 2023Publication History

ABSTRACT

Molecular optimization seeks to improve a given molecule's therapeutic profile. It is a key challenge in drug development, but it is difficult due to the constraints of molecular similarity to the original molecule and the size of the chemical space to explore. Numerous works tackled this problem with initial success. Unlike previous works that focus on generating molecules that optimize chemical properties, we focus on the optimization while attempting to "move away" from patented molecules. We present a novel loss function and its utilization in numerous types of molecular optimization algorithms. The loss allows to improve molecular properties while decreasing patent-infringement. We perform empirical evaluation showing superior performance of state-of-the-art models when using the novel loss function. The deployment of the system is underway at the Targeted Drug Delivery and Personalized Medicine labs. It will be utilized to generate targeted carriers of mRNA, providing a new method of drug delivery. The system is also producing non-patented candidates for industrial use, making it a valuable tool in the field of personalized medicine.

References

  1. Sungsoo Ahn, Junsu Kim, Hankook Lee, and Jinwoo Shin. 2020. Guiding deep molecular optimization with genetic exploration. Advances in neural information processing systems, Vol. 33 (2020), 12008--12021.Google ScholarGoogle Scholar
  2. Dávid Bajusz, Anita Rácz, and Károly Héberger. 2015. Why is Tanimoto index an appropriate choice for fingerprint-based similarity calculations? Journal of Cheminformatics, Vol. 7 (05 2015).Google ScholarGoogle ScholarCross RefCross Ref
  3. Guy Barshatski and Kira Radinsky. 2021. Unpaired generative molecule-to-molecule translation for lead optimization. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. Association for Computing Machinery, New York, NY, USA, 2554--2564.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Richard Bickerton, Gaia Paolini, Jérémy Besnard, Sorel Muresan, and Andrew Hopkins. 2012. Quantifying the chemical beauty of drugs. Nature chemistry, Vol. 4 (02 2012), 90--8.Google ScholarGoogle Scholar
  5. Thomas Blaschke, Ola Engkvist, Jürgen Bajorath, and Hongming Chen. 2020. Memory-assisted reinforcement learning for diverse molecular de novo design. Journal of cheminformatics, Vol. 12, 1 (2020), 1--17.Google ScholarGoogle ScholarCross RefCross Ref
  6. Tianfan Fu, Wenhao Gao, Cao Xiao, Jacob Yasonik, Connor W Coley, and Jimeng Sun. 2021. Differentiable scaffolding tree for molecular optimization. arXiv preprint arXiv:2109.10469 (2021).Google ScholarGoogle Scholar
  7. Tianfan Fu, Cao Xiao, and Jimeng Sun. 2020. Core: Automatic molecule optimization using copy & refine strategy. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 638--645.Google ScholarGoogle ScholarCross RefCross Ref
  8. Wengong Jin, Regina Barzilay, and Tommi Jaakkola. 2018. Junction Tree Variational Autoencoder for Molecular Graph Generation. In International Conference on Machine Learning. 2323--2332.Google ScholarGoogle Scholar
  9. G Landrum. 2016. Rdkit: Open-source cheminformatics software.Google ScholarGoogle Scholar
  10. ?ukasz Maziarka, Agnieszka Pocha, Jan Kaczmarczyk, Krzysztof Rataj, Tomasz Danel, and Micha? Warcho?. 2020. Mol-CycleGAN: a generative model for molecular optimization. Journal of Cheminformatics, Vol. 12 (12 2020).Google ScholarGoogle Scholar
  11. AkshatKumar Nigam, Pascal Friederich, Mario Krenn, and Alán Aspuru-Guzik. 2019. Augmenting genetic algorithms with deep neural networks for exploring the chemical space. arXiv preprint arXiv:1909.11655 (2019).Google ScholarGoogle Scholar
  12. Marcus Olivecrona, Thomas Blaschke, Ola Engkvist, and Hongming Chen. 2017. Molecular de-novo design through deep reinforcement learning. Journal of cheminformatics, Vol. 9, 1 (2017), 1--14.Google ScholarGoogle ScholarCross RefCross Ref
  13. George Papadatos, Mark Davies, Nathan Dedman, Jon Chambers, Anna Gaulton, James Siddle, Richard Koks, Sean A Irvine, Joe Pettersson, Nicko Goncharoff, et al. 2016. SureChEMBL: a large-scale, chemically annotated patent document database. Nucleic acids research, Vol. 44, D1 (2016), D1220--D1228.Google ScholarGoogle Scholar
  14. David Rogers and Mathew Hahn. 2010. Extended-connectivity fingerprints. Journal of chemical information and modeling, Vol. 50, 5 (2010), 742--754.Google ScholarGoogle ScholarCross RefCross Ref
  15. Teague Sterling and John J Irwin. 2015. ZINC 15--ligand discovery for everyone. Journal of chemical information and modeling, Vol. 55, 11 (2015), 2324--2337.Google ScholarGoogle ScholarCross RefCross Ref
  16. J. Zhu, T. Park, P. Isola, and A. A. Efros. 2017. Unpaired Image-to-Image Translation Using Cycle-Consistent Adversarial Networks. In 2017 IEEE International Conference on Computer Vision (ICCV). 2242--2251.Google ScholarGoogle Scholar

Index Terms

  1. Generating Optimized Molecules without Patent Infringement

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          CIKM '23: Proceedings of the 32nd ACM International Conference on Information and Knowledge Management
          October 2023
          5508 pages
          ISBN:9798400701245
          DOI:10.1145/3583780

          Copyright © 2023 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 21 October 2023

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate1,861of8,427submissions,22%

          Upcoming Conference

        • Article Metrics

          • Downloads (Last 12 months)67
          • Downloads (Last 6 weeks)15

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader