Finding occurrences of protein complexes in protein-protein interaction graphs

@article{Fertin2009FindingOO,
  title={Finding occurrences of protein complexes in protein-protein interaction graphs},
  author={Guillaume Fertin and Romeo Rizzi and St{\'e}phane Vialette},
  journal={J. Discrete Algorithms},
  year={2009},
  volume={7},
  pages={90-101}
}
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)-Matching problems, where μG (resp. μH) denotes in both problems the maximum number of orthologous proteins in H (resp. G) of a protein in G… CONTINUE READING