Querying Protein-Protein Interaction Networks

Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying patterns in the shape of paths or trees in Protein-Protein Interaction networks. In this paper, we propose an exact algorithm for querying graphs pattern based on dynamic programming and color-coding. We provide an implementation which has been validated on real data.

[1]  James R. Knight,et al.  A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae , 2000, Nature.

[2]  D. Eisenberg,et al.  Assigning protein functions by comparative genome analysis: protein phylogenetic profiles. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[3]  E. Myers,et al.  Basic local alignment search tool. , 1990, Journal of molecular biology.

[4]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[5]  Hans L. Bodlaender,et al.  A Cubic Kernel for Feedback Vertex Set , 2007, STACS.

[6]  T. Ideker,et al.  Comprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae , 2006, Journal of biology.

[7]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[8]  Paul Dent,et al.  MAPK pathways in radiation responses , 2003, Oncogene.

[9]  Roded Sharan,et al.  Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks , 2006, J. Comput. Biol..

[10]  Noga Alon,et al.  Color-coding , 1995, JACM.

[11]  Thomas Zichner,et al.  Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection , 2007, APBC.

[12]  Gary D Bader,et al.  Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry , 2002, Nature.

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

[14]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

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

[16]  Ron Y. Pinter,et al.  Alignment of metabolic pathways , 2005, Bioinform..

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

[18]  Susumu Goto,et al.  The KEGG resource for deciphering the genome , 2004, Nucleic Acids Res..

[19]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[20]  Ioannis Xenarios,et al.  DIP, the Database of Interacting Proteins: a research tool for studying cellular networks of protein interactions , 2002, Nucleic Acids Res..

[21]  P. Bork,et al.  Functional organization of the yeast proteome by systematic analysis of protein complexes , 2002, Nature.

[22]  Stéphan Thomassé.  A quadratic kernel for feedback vertex set , 2009, SODA.

[23]  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.

[24]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..