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

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.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
• Keywords: ICALP 2007, Important Area, Metabolic Network Analysis, Theoretical Computer Science, Vertex-colored Graphs