TY - GEN
T1 - Parameterized algorithms for module motif
AU - Zehavi, Meirav
PY - 2013/10/15
Y1 - 2013/10/15
N2 - 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.
AB - 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.
KW - module motif
KW - parameterized algorithm
KW - pattern matching
UR - http://www.scopus.com/inward/record.url?scp=84885232111&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-642-40313-2_72
DO - https://doi.org/10.1007/978-3-642-40313-2_72
M3 - Conference contribution
SN - 9783642403125
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 825
EP - 836
BT - Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings
T2 - 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013
Y2 - 26 August 2013 through 30 August 2013
ER -