On motifs in colored graphs

One of the most important concepts in biological network analysis is that of network motifs, which are patterns of interconnections that occur in a given network at a frequency higher than expected in a random network. In this work we are interested in searching and inferring network motifs in a class of biological networks that can be represented by vertex-colored graphs. We show the computational complexity for many problems related to colorful topological motifs and present efficient algorithms for special cases. We also present a probabilistic strategy to detect highly frequent motifs in vertex-colored graphs. Experiments on real data sets show that our algorithms are very competitive both in efficiency and in quality of the solutions.

[1]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[2]  Roded Sharan,et al.  QPath: a method for querying pathways in a protein-protein interaction network , 2006, BMC Bioinformatics.

[3]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[4]  Eloi Araujo,et al.  Some results on topological colored motifs in metabolic networks , 2013, 13th IEEE International Conference on BioInformatics and BioEngineering.

[5]  J. J. Díaz-Mejía,et al.  A network perspective on the evolution of metabolism by gene duplication , 2007, Genome Biology.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[8]  Ron Y. Pinter,et al.  Deterministic Parameterized Algorithms for the Graph Motif Problem , 2014, MFCS.

[9]  Roded Sharan,et al.  QNet: A Tool for Querying Protein Interaction Networks , 2007, RECOMB.

[10]  Sebastian Wernicke,et al.  FANMOD: a tool for fast network motif detection , 2006, Bioinform..

[11]  Sebastian Bonhoeffer,et al.  The Evolution of Connectivity in Metabolic Networks , 2005, PLoS biology.

[12]  Michael R. Fellows,et al.  Upper and lower bounds for finding connected motifs in vertex-colored graphs , 2011, J. Comput. Syst. Sci..

[13]  David Botstein,et al.  GO: : TermFinder--open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genes , 2004, Bioinform..

[14]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

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

[16]  M. Ashburner,et al.  Gene Ontology: tool for the unification of biology , 2000, Nature Genetics.

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

[18]  Cristina G. Fernandes,et al.  Reaction Motifs in Metabolic Networks , 2005, WABI.

[19]  R. Karp,et al.  Conserved pathways within bacteria and yeast as revealed by global protein network alignment , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

[21]  Marie-France Sagot,et al.  Assessing the Exceptionality of Coloured Motifs in Networks , 2008, EURASIP J. Bioinform. Syst. Biol..

[22]  Sahar Asadi,et al.  Kavosh: a new algorithm for finding network motifs , 2009, BMC Bioinformatics.

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

[24]  Guillaume Blin,et al.  GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks , 2010, BICoB.

[25]  Eloi Araujo,et al.  SIMBio: Searching and inferring colorful motifs in biological networks , 2015, 2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE).

[26]  Ron Y. Pinter,et al.  Algorithms for topology-free and alignment network queries , 2014, J. Discrete Algorithms.

[27]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .