Global alignment of protein - Protein interaction networks by graph matching methods

Bioinformatics

Volumn 25, Issue 12, 2009, Pages

  Zaslavskiy, Mikhail ^a,b,c   Bach, Francis ^d   Vert, Jean Philippe ^a,b,c  

^a PSL RESEARCH UNIVERSITY   (France)

^b INSTITUT CURIE   (France)

^c INSERM U900   (France)

^d ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROTEIN;

COMPUTER PROGRAM; CONFERENCE PAPER; DROSOPHILA MELANOGASTER; GENETIC CONSERVATION; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; NONHUMAN; ORTHOLOGY; PRIORITY JOURNAL; PROTEIN PROTEIN INTERACTION; SACCHAROMYCES CEREVISIAE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY; SPECIES DIFFERENCE;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATABASES, PROTEIN; PROTEIN INTERACTION MAPPING; PROTEINS; SEQUENCE ALIGNMENT;

EID: 66349109783     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btp196     Document Type: Conference Paper

References (27)

1. Aebersold,R. and Mann,M. (2003) Mass spectrometry-based proteomics. Nature, 422, 198-207.
2. Almohamad,H. and Duffuaa,S. (1993) A linear programming approach for the weighted graph matching problem. IEEE Trans. Inform. Theor., 15 522-525.
3. Bandyopadhyay,S. et al. (2006) Systematic identification of functional orthologs based on protein network comparison. Genome Res. 16, 428-435.
4. Berg,J. and Lässig,M. (2006) Cross-species analysis of biological networks by bayesian alignment. Proc. Natl Acad. Sci. USA, 103 10967-10972.
5. Brein,K. et al. (2005) Inparanoid: A comprehensive database of eukaryothic orthologs. Nucleic Acids Res., 33, D476-D480.
6. Caelli,T. and Kosinov,S. (2004) An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 26, 515-519.
7. Conte,D. et al. (2004) Thirty years of graph matching in pattern recognition. Intern. J. Pattern Recognit. Artif. Intell., 18 265-298.
8. Durbin,R. et al. (1998) Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, NY.
9. Fields,S. and Song,O. (1989) A novel genetic system to detect protein-protein interactions. Nature, 340, 245-246.
10. Flannick,J. et al. (2006) Graemlin: General and robust alignment of multiple large interaction networks. Genome Res., 16, 1169-1181.
11. Gold,S. and Rangarajan,A. (1996) A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 18, 377-388.
12. Jordan,M. (ed.) (2001) Learning in Graphical Models. The MIT Press, Cambridge.
13. Kelley,B. et al. (2003) Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc. Natl Acad. Sci. USA, 100, 11394-11399.
14. Kelley,B. et al. (2004) PathBLAST: A tool for alignment of protein interaction networks. Nucleic Acids Res., 32, W83-W88.
15. Koyutürk,M. et al. (2006) Pairwise alignment of protein interaction networks. J. Comput. Biol., 13, 182-199.
16. Kuhn,H.W. (1955) The Hungarian method for the assignment problem. Nav. Res., 2, 83-97.
17. Remm,M. et al. (2001) Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J. Mol. Biol., 314, 1041-1052.
18. Sharan,R. et al. (2005) Conserved patterns of protein interaction in multiple species. Proc. Natl Acad. Sci. USA, 102, 1974-1979.
19. Singh,R. et al. (2008) Global alignment of multiple protein interaction networks with application to functional orthology detection. Proc. Natl Acad. Sci. USA, 105, 12763-12768.
20. Sjölander,K. (2004) Phylogenomic inference of protein molecular function: Advances and challenges. Bioinformatics, 20, 170-179.
21. Suthram,S. et al. (2005) The plasmodium protein network diverges from those of other eukaryotes. Nature, 438, 108-112.
22. Umeyama,S. (1988) An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell., 10 695-703.
23. Viterbi,A. (1973) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theor. 13, 260-269.
24. Yosef,N. et al. (2008) Improved network-based identification of protein orthologs. Bioinformatics, 24, i200-i206.
25. Zaslavskiy,M. et al. (2008a) GRAPHM: Graph matching package. Available at http://cbio.ensmp.fr/graphm (last accessed date March 2009).
26. Zaslavskiy,M. et al. (2008b) A path following algorithm for graph matching. In Image and Signal Processing, Proceedings of the 3rd International Conference, ICISP 2008, Elmoataz,A. et al. eds, Vol. 5099 of LNCS, Springer, Berlin/Heidelberg, pp. 329-337.
27. Zaslavskiy,M. et al. (2008c). A path following algorithm for the graph matching problem. Technical Report 00232851, HAL. Mines ParisTech.