Deterministic parameterized algorithms for the graph motif problem

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

We study the classic Graph Motif problem: given a graph G=(V,E) with a set of colors for each node, and a multiset M of colors, we seek a subtree T⊆G, and a coloring of the nodes in T, such that T carries exactly (also with respect to multiplicity) the colors in M. Graph Motif plays a central role in the study of pattern matching problems, primarily motivated from the analysis of complex biological networks. Previous algorithms for Graph Motif and its variants either rely on techniques for developing randomized algorithms that, if derandomized, render them inefficient, or the algebraic narrow sieves technique for which there is no known derandomization. In this paper, we present fast deterministic parameterized algorithms for Graph Motif and its variants. Specifically, we give such an algorithm for the more general Graph Motif with Deletions problem, followed by faster algorithms for Graph Motif and other well-studied special cases. Our algorithms make non-trivial use of representative families, and a novel tool that we call guiding trees, together enabling the efficient construction of the output tree.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
PublisherSpringer Verlag
Pages589-600
Number of pages12
EditionPART 2
ISBN (Print)9783662444641
DOIs
StatePublished - 1 Jan 2014
Externally publishedYes
Event39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary
Duration: 25 Aug 201429 Aug 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume8635 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
Country/TerritoryHungary
CityBudapest
Period25/08/1429/08/14

Fingerprint

Dive into the research topics of 'Deterministic parameterized algorithms for the graph motif problem'. Together they form a unique fingerprint.

Cite this