Document Open Access Logo

Computational Generation of Substrate-Specific Molecular Cages

Authors Noé Demange , Yann Strozecki , Sandrine Vial

PDF

File

Thumbnail PDF
PDF
LIPIcs.SEA.2026.15.pdf
  • Filesize: 3.56 MB
  • 21 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Applied computing → Chemistry
Keywords
  • Enumeration
  • Molecular Cage
  • Cheminformatics
  • Geometric Algorithms
  • Experimental Algorithms

Metrics

Abstract

In this paper, we propose a method to build molecular cages designed to capture a specific substrate. We model a cage as a graph of atoms with coordinates in space, and several constraints on their edges (degree, length and angle). We use a simple method to place binding patterns which are able to interact with certain parts of the substrate. We then propose an algorithm which considers all possible ways of connecting these binding patterns and try to construct the smallest possible molecular paths realizing these connections. We investigate many variants of our method in order to obtain the most efficient algorithm, able to build cages of more than a hundred atoms.

Cite As Get BibTex

Noé Demange, Yann Strozecki, and Sandrine Vial. Computational Generation of Substrate-Specific Molecular Cages. In 24th International Symposium on Experimental Algorithms (SEA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 371, pp. 15:1-15:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SEA.2026.15

Author Details

Noé Demange
  • DAVID lab, UVSQ - University Paris-Saclay, Versailles, France
Yann Strozecki
  • DAVID lab, UVSQ - University Paris-Saclay, Versailles, France
Sandrine Vial
  • DAVID lab, UVSQ - University Paris-Saclay, Versailles, France

Acknowledgements

Authors want to thank Olivier David for his helpful comments.

Supplementary Materials

References

  1. Ylène Aboulfath, Dominique Barth, Thierry Mautor, Dimitri Watel, and Marc-Antoine Weisser. Polymorphic Cycle Basis in a Sequence of Graphs to Analyze the Structural Evolution of a Molecular Dynamic Trajectory. In 23rd International Symposium on Experimental Algorithms (SEA 2025), volume 338 of Leibniz International Proceedings in Informatics (LIPIcs), pages 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.SEA.2025.1.
  2. Dmytro Antypov, Argyrios Deligkas, Vladimir Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, and Michail Theofilatos. Crystal Structure Prediction via Oblivious Local Search. In 18th International Symposium on Experimental Algorithms (SEA 2020), pages 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.SEA.2020.21.
  3. Elangannan Arunan, Gautam R. Desiraju, Roger A. Klein, Joanna Sadlej, Steve Scheiner, Ibon Alkorta, David C. Clary, Robert H. Crabtree, Joseph J. Dannenberg, Pavel Hobza, Henrik G. Kjaergaard, Anthony C. Legon, Benedetta Mennucci, and David J. Nesbitt. Definition of the hydrogen bond (IUPAC Recommendations 2011). Pure and Applied Chemistry, 83(8):1637-1641, 2011. Google Scholar
  4. Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, and Sandrine Vial. Efficient generation of stable planar cages for chemistry. In International Symposium on Experimental Algorithms (SEA), pages 235-246. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-20086-6_18.
  5. Jon L Bentley. A survey of techniques for fixed radius near neighbor searching. Technical report, Stanford University, 1975. Google Scholar
  6. Alain Bretto, Alain Faisant, and François Hennecart. Elements of Graph Theory: From Basic Concepts to Modern Developments, volume 24 of EMS Textbooks in Mathematics. EMS Press, 1 edition, 2022. URL: https://doi.org/10.4171/etb/24.
  7. Marie Bricage. Modélisation et Algorithmique de graphes pour la construction de structures moléculaires. PhD thesis, Université Paris Saclay, 2018. Google Scholar
  8. Coen Bron and Joep Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973. Google Scholar
  9. The Cambridge Crystallographic Data Centre. Cambridge structural database. URL: https://www.ccdc.cam.ac.uk/.
  10. Donald J. Cram. The Design of Molecular Hosts, Guests, and Their Complexes (Nobel Lecture). Angewandte Chemie International Edition in English, 27(8):1009-1020, 1987. Google Scholar
  11. Noé Demange. MolecularCagesGeneration. Software, (visited on 2026-05-27). URL: https://github.com/NoeDemange/MolecularCagesGeneration
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.25788
  12. Coline Gianfrotta, Vladimir Reinharz, Dominique Barth, and Alain Denise. A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures. In 19th International Symposium on Experimental Algorithms (SEA 2021), pages 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.SEA.2021.19.
  13. Ronald J. Gillespie. The valence-shell electron-pair repulsion (VSEPR) theory of directed valency. Journal of Chemical Education, 40(6):295, 1963. Google Scholar
  14. Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968. URL: https://doi.org/10.1109/TSSC.1968.300136.
  15. James R. Holst, Abbie Trewin, and Andrew I. Cooper. Porous organic molecules. Nature Chemistry, 2(11):915-920, 2010. Google Scholar
  16. Htoo Htoo, Yutaka Ohsawa, Noboru Sonehara, and Masao Sakauchi. Incremental Single-Source Multi-Target A* Algorithm for LBS Based on Road Network Distance. IEICE Transactions on Information and Systems, E96.D(5):1043-1052, 2013. URL: https://doi.org/10.1587/TRANSINF.E96.D.1043.
  17. John Jumper, Richard Evans, Alexander Pritzel, Tim Green, Michael Figurnov, Olaf Ronneberger, Kathryn Tunyasuvunakool, Russ Bates, Augustin Žídek, Anna Potapenko, et al. Highly accurate protein structure prediction with alphafold. nature, 596(7873):583-589, 2021. Google Scholar
  18. Richard M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, pages 85-103. Springer, 1972. URL: https://doi.org/10.1007/978-1-4684-2001-2_9.
  19. Jean-Marie Lehn. Supramolecular Chemistry - Scope and Perspectives Molecules, Supermolecules, and Molecular Devices (Nobel Lecture). Angewandte Chemie International Edition in English, 27(1):89-112, 1987. Google Scholar
  20. Jean-Marie Lehn. Dynamic combinatorial chemistry and virtual combinatorial libraries. In Essays in Contemporary Chemistry, pages 307-326. Wiley, 2001. Google Scholar
  21. Prasenjit Mal, Boris Breiner, Kari Rissanen, and Jonathan R. Nitschke. White phosphorus is air-stable within a self-assembled tetrahedral capsule. Science, 324(5935):1697-1699, 2009. Google Scholar
  22. Emmanuel A Meyer, Ronald K Castellano, and François Diederich. Interactions with aromatic rings in chemical and biological recognition. Angewandte Chemie International Edition, 42(11):1210-1250, 2003. Google Scholar
  23. Charles J. Pedersen. The Discovery of Crown Ethers (Noble Lecture). Angewandte Chemie International Edition in English, 27(8):1021-1027, 1987. Google Scholar
  24. John W Raymond and Peter Willett. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of computer-aided molecular design, 16(7):521-533, 2002. URL: https://doi.org/10.1023/A:1021271615909.
  25. Schrödinger, LLC. The PyMOL molecular graphics system, version 2.5.0. Open-source build, 2021. Google Scholar
  26. Yann Strozecki. Enumeration complexity: Incremental time, delay and space. Habilitation à diriger des recherches, 2021. Google Scholar
  27. Bruno Therrien. Drug delivery by water-soluble organometallic cages. Chemistry of Nanocontainers, pages 35-55, 2012. Google Scholar
  28. Nenad Trinajstic. Chemical graph theory. CRC press, 2018. Google Scholar
  29. Robert A. Tromans, Tom S. Carter, Laurent Chabanne, Matthew P. Crump, Hongyu Li, Johnathan V. Matlock, Michael G. Orchard, and Anthony P. Davis. A biomimetic receptor for glucose. Nature Chemistry, 11(1):52-56, 2019. Google Scholar
  30. Takeaki Uno. Constant time enumeration by amortization. In Workshop on Algorithms and Data Structures, pages 593-605. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21840-3_49.
  31. Xinchun Yang, Zakir Ullah, J. Fraser Stoddart, and Cafer T. Yavuz. Porous Organic Cages. Chemical Reviews, 123(8), 2023. Google Scholar
  32. Gang Zhang and Michael Mastalerz. Organic cage compounds – from shape-persistency to function. Chemical Society Reviews, 43:1934-1947, 2014. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact