A fast discovery algorithm for large common connected induced subgraphs

We present a fast algorithm for the classical problem of finding common subgraphs, which are useful for detecting structural relationships between biological macromolecules. Although the cost is potentially high for this hard problem, we improve performance by several orders of magnitude compared to known algorithms. We validate our findings with experiments on proteins with thousands of atoms

A Fast Discovery Algorithm for Large Common Connected Induced Subgraphs

International audienc