Some Results on More Flexible Versions of Graph Motif

The problems studied in this paper originate from Graph Motif, a problem introduced in 2006 in the context of biological networks. Informally speaking, it consists in deciding if a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Due to the high rate of noise in the biological data, more flexible definitions of the problem have been outlined. We present in this paper two inapproximability results for two different optimization variants of Graph Motif: one where the size of the solution is maximized, the other when the number of substitutions of colors to obtain the motif from the solution is minimized. We also study a decision version of Graph Motif where the connectivity constraint is replaced by the well known notion of graph modularity. While the problem remains NP-complete, it allows algorithms in FPT for biologically relevant parameterizations.

[1]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[2]  Cristina G. Fernandes,et al.  Motif Search in Graphs: Application to Metabolic Networks , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[3]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[4]  Riccardo Dondi,et al.  Finding Approximate and Constrained Motifs in Graphs , 2011, CPM.

[5]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Ioannis Koutis.  Constrained multilinear detection for faster functional motif discovery , 2012, Inf. Process. Lett..

[7]  T. Ideker,et al.  Modeling cellular machinery through biological network comparison , 2006, Nature Biotechnology.

[8]  Andreas Björklund,et al.  Probably Optimal Graph Motifs , 2013, STACS.

[9]  W. Cunningham.  Decomposition of Directed Graphs , 1982 .

[10]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[11]  Christian Komusiewicz,et al.  Parameterized Algorithms and Hardness Results for Some Graph Motif Problems , 2008, CPM.

[12]  Julien Gagneur,et al.  Modular decomposition of protein-protein interaction networks , 2004, Genome Biology.

[13]  Michel Habib,et al.  Partitive hypergraphs , 1981, Discret. Math..

[14]  Ulrik Brandes,et al.  Biological Networks , 2013, Handbook of Graph Drawing and Visualization.

[15]  Florian Sikora,et al.  Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison) , 2011 .

[16]  D. Pe’er,et al.  Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data , 2003, Nature Genetics.

[17]  Gary D Bader,et al.  The Genetic Landscape of a Cell , 2010, Science.

[18]  Mark Gerstein,et al.  Bridging structural biology and genomics: assessing protein interaction data with known complexes. , 2002, Drug discovery today.

[19]  Riccardo Dondi,et al.  Complexity issues in vertex-colored graph pattern matching , 2011, J. Discrete Algorithms.

[20]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[21]  Sylvain Guillemot,et al.  Finding and Counting Vertex-Colored Subtrees , 2010, Algorithmica.

[22]  Michael R. Fellows,et al.  Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs , 2007, ICALP.

[23]  Roded Sharan,et al.  Topology-Free Querying of Protein Interaction Networks , 2009, RECOMB.

[24]  Florian Rasche,et al.  Annotating Fragmentation Patterns , 2009, WABI.

[25]  Elias Dahlhaus,et al.  Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition , 2000, J. Algorithms.

[26]  Geevarghese Philip,et al.  On the Kernelization Complexity of Colorful Motifs , 2010, IPEC.

[27]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[28]  Michel Habib,et al.  A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension , 2004, SWAT.

[29]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[30]  Irena Rusu,et al.  Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions , 2009, Bioinform..

[31]  Ryan Williams,et al.  Limits and Applications of Group Algebras for Parameterized Problems , 2009, ICALP.