Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs

@article{Fagnot2008BoundedLI,
  title={Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs},
  author={Isabelle Fagnot and Ga{\"e}lle Lelandais and St{\'e}phane Vialette},
  journal={J. Discrete Algorithms},
  year={2008},
  volume={6},
  pages={178-191}
}
Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. 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. We show that the problem is polynomial-time solvable provided that each protein has at most two orthologs in the other species, but is hard for three. Also, we suggest ways to… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphs

I. Fagnot, G. Lelandais, S. Vialette
in: Proc. of the 1st Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets), KCL Publications • 2004
View 1 Excerpt

Mirny , Protein complexes and functional modules in molecular networks

L. V. Spirin
Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data , in : Proc . of the 8 th Annual International Conference on Computational Molecular Biology ( RECOMB • 2004

P

B. Titz, M. Schlesner
Uetz, What do we learn from high-throughput protein interaction data? Expert Review of Anticancer Therapy 1 (1) • 2004
View 1 Excerpt

Conserved pathways within bacteria and yeast as revealed by global protein network alignment.

Proceedings of the National Academy of Sciences of the United States of America • 2003
View 1 Excerpt

Similar Papers

Loading similar papers…