Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs

  • Guillaume Fertin
  • Romeo Rizzi
  • Stéphane Vialette
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3618)


In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex G in the protein-protein interaction graph H of another species with respect to (w.r.t.) orthologous proteins. Two problems are considered: the Exact-(μ G , μ H )-Matching problem and the Max-(μ G , μ H ) problem, where μ G (resp. μ H ) denotes in both problems the maximum number of orthologous proteins in H (resp. G) of a protein in G (resp. H). Following [FLV04], the Exact-(μ G , μ H )-Matching problem asks for an injective homomorphism of G to H w.r.t. orthologous proteins. The optimization version is called the Max-(μ G , μ H )-Matching problem and is concerned with finding an injective mapping of a graph G to a graph H w.r.t. orthologous proteins that matches as many edges of G as possible. For both problems, the emphasis here is clearly on bounded degree graphs and extremal small values of parameters μ G and μ H .


Bipartite Graph Injective Mapping Truth Assignment Orthologous Protein Injective Homomorphism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ACG+99]
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  2. [AEH81]
    Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs IV: Linear arboricity. Networks 11, 69–72 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  3. [AGGN02]
    Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Towards optimally solving the LONGEST COMMON SUBSEQUENCE problem for sequences with nested arc annotations in linear time. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 99–114. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. [Alo88]
    Alon, N.: The linear arboricity of graphs. Israel Journal of Mathematics 62(3), 311–325 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  5. [AS92]
    Alon, N., Spencer, J.H.: The probabilistic method. Wiley, Chichester (1992)zbMATHGoogle Scholar
  6. [BDF+95]
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11, 49–57 (1995)Google Scholar
  7. [BK99]
    Berman, P., Karpinski, M.: On some tighter inapproximability results. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200–209. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. [DF99]
    Downey, R., Fellows, M.: Parameterized complexity. Springer, Heidelberg (1999)Google Scholar
  9. [FLV04]
    Fagnot, I., Lelandais, G., Vialette, S.: Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. In: Proc. of the 1st Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets), pp. 45–70. KCL publications (2004)Google Scholar
  10. [Gav02]
    Gavin, A.C., Boshe, M., et al.: Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 414(6868), 141–147 (2002)CrossRefGoogle Scholar
  11. [GGN02]
    Gramm, J., Guo, J., Niedermeier, R.: Pattern matching for arc-annotated sequences. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 182–193. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. [GJ79]
    Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Franciso (1979)zbMATHGoogle Scholar
  13. [HG02]
    Ho, Y., al, A.G.e.: Systematic identification of protein complexes in Saccharomyces cerevisae by mass spectrometry. Nature 415(6868), 180–183 (2002)CrossRefGoogle Scholar
  14. [KSK+03]
    Kelley, B.P., Sharan, R., Karp, R.M., Sittler, T., Root, D.E., Stockwell, B.R., Ideker, T.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. PNAS 100(20), 11394–11399 (2003)CrossRefGoogle Scholar
  15. [MV80]
    Micali, S., Vazirani, V.V.: An \({O(\sqrt{|V|}|E|)}\) algorithm for finding maximum matching in general graphs. In: Proc. of the 21st Annual Symposium on Foundation of Computer Science (FOCS), pp. 17–27. IEEE, Los Alamitos (1980)Google Scholar
  16. [PLEO04]
    Pereira-Leal, J.B., Enright, A.J., Ouzounis, C.A.: Detection of functional modules from protein interaction networks. Proteins 54(1), 49–57 (2004)CrossRefGoogle Scholar
  17. [PMT+99]
    Pellegrini, M., Marcotte, E.M., Thompson, M.J., Eisenberg, D., Yeates, T.O.: Assigning protein functions by comparative genome analysis: protein phylogenetic profiles. PNAS 96(8), 4285–4288 (1999)CrossRefGoogle Scholar
  18. [SIK+04]
    Sharan, R., Ideker, T., Kelley, B., Shamir, R., Karp, R.M.: Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. In: Proc. of the 8th annual international conference on Computational molecular biology (RECOMB 2004), pp. 282–289. ACM Press, New York (2004)Google Scholar
  19. [SSK+05]
    Sharan, R., Suthram, S., Kelley, R.M., Kuhn, T., McCuin, S., Uetz, P., Sittler, T., Karp, R., Ideker, T.: Conserved patterns of protein interaction in multiple species. PNAS 102(6), 1974–1979 (2005)CrossRefGoogle Scholar
  20. [TSU04]
    Titz, B., Schlesner, M., Uetz, P.: What do we learn from high-throughput protein interaction data? Expert Review of Anticancer Therapy 1(1), 111–121 (2004)Google Scholar
  21. [Uet00]
    Uetz, P., Giot, L., et al.: A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisae. Nature 403(6770), 623–627 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Guillaume Fertin
    • 1
  • Romeo Rizzi
    • 2
  • Stéphane Vialette
    • 3
  1. 1.Laboratoire d’Informatique de Nantes-Atlantique (LINA), FRE CNRS 2729Université de NantesNantes Cedex 3France
  2. 2.Facoltà di Scienze – Dipartimento di Informatica e TelecomunicazioniUniversità degli Studi di TrentoPovo – TrentoItaly
  3. 3.Laboratoire de Recherche en Informatique (LRI), UMR CNRS 8623, Faculté des Sciences d’OrsayUniversité Paris-SudOrsayFrance

Personalised recommendations