Sciweavers

ICALP
2007
Springer

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

14 years 6 months ago
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.
Michael R. Fellows, Guillaume Fertin, Danny Hermel
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICALP
Authors Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Comments (0)