Finding Approximate and Constrained Motifs in Graphs

Abstract : One of the emerging topics in the analysis of biological networks is the inference of motifs inside a network. In the context of metabolic network analysis, a recent approach introduced in [14], represents the network as a vertex-colored graph, while a motif M is represented as a multiset of colors. An occurrence of a motif M in a vertexcolored graph G is a connected induced subgraph of G whose vertex set is colored exactly asM.We investigate three di erent variants of the initial problem. The first two variants, Min-Add and Min-Substitute, deal with approximate occurrences of a motif in the graph, while the third variant, Constrained Graph Motif (or CGM for short), constrains the motif to contain a given set of vertices. We investigate the classical and parameterized complexity of the three problems. We show that Min- Add and Min-Substitute are NP-hard, even when M is a set, and the graph is a tree of degree bounded by 4 in which each color appears at most twice. Moreover, we show that Min-Substitute is in FPT when parameterized by the size of M. Finally, we consider the parameterized complexity of the CGM problem, and we give a xed-parameter algorithm for graphs of bounded treewidth, while we show that the problem is W[2]-hard, even if the input graph has diameter 2.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, July 5, 2011 - 3:51:01 PM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM
Document(s) archivé(s) le : Monday, November 12, 2012 - 10:10:50 AM


Files produced by the author(s)



Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding Approximate and Constrained Motifs in Graphs. CPM 2011, 2011, Palermo, Italy. pp.388-401, ⟨10.1007/978-3-642-21458-5_33⟩. ⟨hal-00606173⟩



Record views


Files downloads