Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2009

Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs

Résumé

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-($\mu$G; $\mu$H)-Matching problem and the Max-($\mu$G; $\mu$H)-Matching problems, where $\mu$G (resp. $\mu$H) denotes in both problems the maximum number of orthologous proteins in H (resp. G) of a protein in G (resp. H). Following [10], the Exact-($\mu$G; $\mu$H)-Matching problem asks for an injective homomorphism of G to H w.r.t. orthologous proteins. The optimization version is called the Max-($\mu$G; $\mu$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, we essentially focus on bounded degree graphs and extremal small values of parameters $\mu$G and $\mu$H.
Fichier principal
Vignette du fichier
AlphaBetaJDA.pdf (228.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00416394 , version 1 (14-09-2009)

Identifiants

  • HAL Id : hal-00416394 , version 1

Citer

Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. Journal of Discrete Algorithms, 2009, 7 (1), pp.90-101. ⟨hal-00416394⟩
163 Consultations
110 Téléchargements

Partager

Gmail Facebook X LinkedIn More