A Fast Algorithm for Large Common Connected Induced Subgraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

A Fast Algorithm for Large Common Connected Induced Subgraphs

Abstract

We present a fast algorithm for finding large common sub-graphs, which can be exploited for detecting structural and functional relationships between biological macromolecules. Many fast algorithms exist for finding a single maximum common subgraph. We show with an example that this gives limited information, motivating the less studied problem of finding many large common subgraphs covering different areas. As the latter is also hard, we give heuristics that improve performance by several orders of magnitude. As a case study, we validate our findings experimentally on protein graphs with thousands of atoms.
Fichier principal
Vignette du fichier
A Fast Algorithm for Large Common Connected Induced Subgraphs.pdf (340.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01555996 , version 1 (04-07-2017)

Identifiers

Cite

Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari. A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB 2017: 4th International Conference on Algorithms for Computational Biology, Jun 2017, Aveiro, Portugal. pp.828 - 74, ⟨10.1021/ci9601675⟩. ⟨hal-01555996⟩
168 View
341 Download

Altmetric

Share

Gmail Facebook X LinkedIn More