Parameterized algorithms for module motif

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

7 Scopus citations

Abstract

Module Motif is a pattern matching problem that was introduced in the context of biological networks. Informally, given a multiset of colors P and a graph H whose nodes have sets of colors, it asks if P occurs in a module of H (i.e. in a set of nodes that have the same neighborhood outside the set). We present three parameterized algorithms for this problem that measure similarity between matched colors and handle deletions and insertions of colors to P. We observe that the running time of two of them might be essentially tight and prove that the problem is unlikely to admit a polynomial kernel.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings
Pages825-836
Number of pages12
DOIs
StatePublished - 15 Oct 2013
Externally publishedYes
Event38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 - Klosterneuburg, Austria
Duration: 26 Aug 201330 Aug 2013

Publication series

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

Conference

Conference38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013
Country/TerritoryAustria
CityKlosterneuburg
Period26/08/1330/08/13

Keywords

  • module motif
  • parameterized algorithm
  • pattern matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Parameterized algorithms for module motif'. Together they form a unique fingerprint.

Cite this