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

  • Authors:

  • Michael R. Fellows;Guillaume Fertin;Danny Hermelin;Stéphane Vialette

  • Affiliations:

  • The University of Newcastle, Callaghan, Australia and Institute of Advanced Study, Durham University, Durham, United Kingdom;Laboratoire d'Informatique de Nantes-Atlantique, FRE CNRS 2729, Université de Nantes, Nantes Cedex 3, France;Department of Computer Science, University of Haifa, Haifa, Israel;Laboratoire de Recherche en Informatique, UMR CNRS 8623, Université Paris-Sud, Orsay, France

  • Venue:
  • ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 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