pith. sign in

Computational Generation of Substrate-Specific Molecular Cages

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.CC 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Complexity of Finding and Enumerating Interconnection Trees

cs.CC · 2026-05-18 · unverdicted · novelty 6.0

Decision problem for minimum interconnection trees in multipartite graphs is NP-complete but FPT in number of parts and polynomial-time on complete, quasi-complete, and t-quasi-complete graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Complexity of Finding and Enumerating Interconnection Trees cs.CC · 2026-05-18 · unverdicted · none · ref 4 · internal anchor

    Decision problem for minimum interconnection trees in multipartite graphs is NP-complete but FPT in number of parts and polynomial-time on complete, quasi-complete, and t-quasi-complete graphs.