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
Conte A.
;Grossi R.;
2019-01-01
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
main (4).pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
746.23 kB
Formato
Adobe PDF
|
746.23 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
