Sharp tractability borderlines for finding connected motifs in vertex-colored graphs

Michael R. Fellows, Guillaume Fertin, Dan Hermelin, Stéphane Vialette

Research output: Contribution to journalConference articlepeer-review

43 Scopus citations


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 whose multiset of colors equals 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.

Original languageEnglish
Pages (from-to)340-351
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - 1 Jan 2007
Externally publishedYes
Event34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland
Duration: 9 Jul 200713 Jul 2007


Dive into the research topics of 'Sharp tractability borderlines for finding connected motifs in vertex-colored graphs'. Together they form a unique fingerprint.

Cite this