Upper and lower bounds for finding connected motifs in vertex-colored graphs

Journal of Computer and System Sciences

Volumn 77, Issue 4, 2011, Pages 799-811

  Fellows, Michael R ^a   Fertin, Guillaume ^b   Hermelin, Danny ^c   Vialette, Stéphane ^d  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITÉ DE NANTES   (France)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d UNIVERSITÉ PARIS EST   (France)

Author keywords

Graph motif; Graph pattern matching; Parameterized complexity; Treewidth; W hardness

Indexed keywords

PATTERN MATCHING;

GRAPH MOTIF; GRAPH PATTERN MATCHING; GRAPH-THEORETIC; MULTISET; PARAMETERIZED COMPLEXITY; TREE-WIDTH; UPPER AND LOWER BOUNDS;

GRAPH THEORY;

EID: 79952539028     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.07.003     Document Type: Conference Paper

References (35)

1. N. Alon, R. Yuster, and U. Zwick Color coding J. ACM 42 4 1995 844 856
2. E. Althaus, S. Canzar, K.M. Elbassioni, A. Karrenbauer, J. Mestre, Approximating the interval constrained coloring problem, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 210-221.
3. E. Althaus, S. Canzar, M.R. Emmett, A. Karrenbauer, A.G. Marshall, A. Meyer-Bäse, H. Zhang, Computing H/D-exchange speeds of single residues from data of peptic fragments, in: Proceedings of the 23rd ACM Symposium on Applied Computing (SAC), 2008, pp. 1273-1277.
4. S. Arnborg Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey BIT 25 1 1985 2 23 (Pubitemid 15513670)
5. S. Arnborg, D.G. Corneil, and A. Proskurowski Complexity of finding embeddings in a k-tree SIAM J. Algebr. Discrete Methods 8 2 1987 277 284
6. S. Arnborg, and A. Proskurowski Linear time algorithms for NP-hard problems restricted to partial k-trees Discrete Appl. Math. 23 1989 11 24
7. B. Aspvall, M.F. Plass, and R.E. Tarjan A linear-time algorithm for testing the truth of certain quantified boolean formulas Inform. Process. Lett. 8 1979 121 123
8. N. Betzler, M.R. Fellows, C. Komusiewicz, R. Niedermeier, Parameterized algorithms and hardness results for some graph motif problems, in: Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM), 2008, pp. 31-43.
9. H.L. Bodlaender A tourist guide through treewidth Acta Cybernet. 11 1993 1 23
10. H.L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth SIAM J. Comput. 25 1996 1305 1317 (Pubitemid 126584672)
11. H.L. Bodlaender, Treewidth: Algorithmic techniques and results, in: Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS), 1997, pp. 19-36. (Pubitemid 127114691)
12. H.L. Bodlaender, L.E. de Fluiter, Intervalizing k-colored graphs, in: Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP), 1995, pp. 87-98.
13. H.L. Bodlaender, M.R. Fellows, M.A. Langston, M.A. Ragan, F.A. Rosamond, M. Weyer, Kernelization for convex recoloring, in: Proceedings of the 2nd Workshop on Algorithms and Complexity in Durham (ACiD), 2006, pp. 23-35.
14. H.L. Bodlaender, M.R. Fellows, T. Warnow, Two strikes against perfect phylogeny, in: Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP), 1992, pp. 273-283.
15. S. Bruckner, F. Hüffner, R.M. Karp, R. Shamir, and R. Sharan Torque: topology-free querying of protein interaction networks Nucleic Acids Res. 37 2009 106 108
16. B. Chor, M.R. Fellows, M.A. Ragan, F.A. Rosamond, S. Snir, Connected coloring completion for general graphs: Algorithms and complexity, in: Proceedings of the 13th Conference on Computing and Combinatorics (COCOON), 2007, pp. 75-85.
17. D.G. Corneil, and J.M. Keil A dynamic programming approach to the dominating set problem on k-trees SIAM J. Algebr. Discrete Methods 8 4 1987 535 543
18. Y. Deville, D. Gilbert, J. Van Helden, and S.J. Wodak An overview of data models for the analysis of biochemical pathways Brief. Bioinform. 4 3 2003 246 259
19. R. Diestel Graph Theory 2000 Springer-Verlag New York
20. R. Dondi, G. Fertin, S. Vialette, Weak pattern matching in colored graphs: Minimizing the number of connected components, in: Proceedings of the 10th Italian Conference on Theoretical Computer Science (ICTCS), 2007, pp. 27-38.
21. R. Dondi, G. Fertin, S. Vialette, Maximum motif problem in vertex-colored graphs, in: Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM), 2009, pp. 221-235.
22. R. Downey, and M. Fellows Parameterized Complexity 1999 Springer-Verlag
23. M.R. Fellows, G. Fertin, D. Hermelin, S. Vialette, Sharp tractability borderlines for finding connected motifs in vertex-colored graphs, in: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP), 2007, pp. 340-351.
24. M.R. Fellows, M.T. Hallett, H.T. Wareham, DNA physical mapping: Three ways difficult, in: Proceedings of the 1st Annual European Symposium on Algorithms (ESA), 1993, pp. 157-168.
25. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
26. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
27. M. Golumbic, H. Kaplan, and R. Shamir On the complexity of DNA physical mapping Adv. in Appl. Math. 15 1994 251 261
28. S. Guillemot, F. Sikora, Finding and counting vertex-colored subtrees, manuscript, 2010.
29. T. Ideker, R.M. Karp, J. Scott, and R. Sharan Efficient algorithms for detecting signaling pathways in protein interaction networks J. Comput. Biol. 13 2 2006 133 144
30. B.P. Kelley, R. Sharan, R.M. Karp, T. Sittler, D.E. Root, B.R. Stockwell, and T. Ideker Conserved pathways within bacteria and yeast as revealed by global protein network alignment Proc. Natl. Acad. Sci. USA 100 20 2003 11394 11399 (Pubitemid 37205946)
31. C. Komusiewicz, R. Niedermeier, J. Uhlmann, Deconstructing intractability: A case study for interval constrained coloring, in: Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM), 2009, pp. 207-220.
32. V. Lacroix, C.G. Fernandes, and M.-F. Sagot Motif search in graphs: Application to metabolic networks IEEE/ACM Trans. Comput. Biol. Bioinform. 3 4 2006 360 368 (Pubitemid 44950085)
33. F.R. McMorris, T.J. Warnow, and T. Wimer Triangulating vertex-colored graphs SIAM J. Discrete Math. 7 2 1994 296 306
34. S. Moran, S. Snir, Convex recolorings of strings and trees: Definitions, hardness results and algorithms, in: Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS), 2005, pp. 218-232. (Pubitemid 41450073)
35. N. Robertson, and P.D. Seymour Graph minors. II. Algorithmic aspects of tree-width SIAM J. Algorithms 7 1986 309 322