Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

Abstract : We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices with a bijection between its colors and the colors of the motif. This problem has applications in metabolic network analysis, an important area in bioinformatics. We give two positive results and three negative results that together draw sharp borderlines between tractable and intractable instances of the problem.
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00417928
Contributor : Guillaume Fertin <>
Submitted on : Thursday, September 17, 2009 - 11:58:55 AM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 8:48:22 PM

File

ICALP07.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00417928, version 1

Citation

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351. ⟨hal-00417928⟩

Share

Metrics

Record views

268

Files downloads

186