Motif Search in Graphs: Application to Metabolic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster Algebraic Algorithms for Path and Packing Problems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Finding paths of length k in O∗(2k) time
Information Processing Letters
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Finding approximate and constrained motifs in graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
RANGI: A Fast List-Colored Graph Motif Finding Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.89 |
The Graph Motif problem asks whether a given multiset of colors appears on a connected subgraph of a vertex-colored graph. The fastest known parameterized algorithm for this problem is based on a reduction to the k-Multilinear Detection (k-MlD) problem: the detection of multilinear terms of total degree k in polynomials presented as circuits. We revisit k-MlD and define k-CMlD, a constrained version of it which reflects Graph Motif more faithfully. We then give a fast algorithm for k-CMlD. As a result we obtain faster parameterized algorithms for Graph Motif and variants of it.