Journal of the ACM (JACM)
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
On the complexity of comparing evolutionary trees
Discrete Applied Mathematics - Special volume on computational molecular biology
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Motif Search in Graphs: Application to Metabolic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Topology-Free Querying of Protein Interaction Networks
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Pairwise local alignment of protein interaction networks guided by models of evolution
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Finding approximate and constrained motifs in graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Finding maximum colorful subtrees in practice
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Hi-index | 0.00 |
Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In this context, different graph motif problems have been considered [13,7,5]. Pursuing a line of research pioneered by Lacroix et al. [13], we introduce in this paper a new graph motif problem: given a vertex colored graph G and a motif $\mathcal{M}$, where a motif is a multiset of colors, find a maximum cardinality submotif $\mathcal{M}' \subseteq \mathcal{M}$ that occurs as a connected motif in G . We prove that the problem is APX-hard even in the case where the target graph is a tree of maximum degree 3, the motif is actually a set and each color occurs at most twice in the tree. Next, we strengthen this result by proving that the problem is not approximable within factor $2^{\rm {log^{\delta} n}}$, for any constant *** NP *** DTIMEclass(2POLY log n). We complement these results by presenting two fixed-parameter algorithms for the problem, where the parameter is the size of the solution. Finally, we give exact fast exponential-time algorithms for the problem.