Local optimization for global alignment of protein interaction networks

Pacific Symposium on Biocomputing 2010, PSB 2010

Volumn , Issue , 2010, Pages 123-132

  Chindelevitch, Leonid ^a   Liao, Chung Shou ^a   Berger, Bonnie ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Functional orthology; Local optimization; Network alignment

Indexed keywords

EVOLUTIONARY HISTORY; GLOBAL ALIGNMENT; LOCAL OPTIMIZATIONS; NETWORK STRUCTURES; NOVEL ALGORITHM; ORTHOLOGY; PAIRWISE ALIGNMENT; PROTEIN INTERACTION NETWORKS;

ACTIVE NETWORKS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; PROTEINS; TRAVELING SALESMAN PROBLEM;

ALIGNMENT;

CAENORHABDITIS ELEGANS PROTEIN; DROSOPHILA PROTEIN; SACCHAROMYCES CEREVISIAE PROTEIN;

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CHEMISTRY; GENETICS; METABOLISM; MOLECULAR EVOLUTION; PROTEIN PROTEIN INTERACTION; SEQUENCE ALIGNMENT;

ALGORITHMS; ANIMALS; CAENORHABDITIS ELEGANS PROTEINS; COMPUTATIONAL BIOLOGY; DROSOPHILA PROTEINS; EVOLUTION, MOLECULAR; MODELS, GENETIC; PROTEIN INTERACTION MAPS; SACCHAROMYCES CEREVISIAE PROTEINS; SEQUENCE ALIGNMENT;

EID: 77955495879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. T. Ito et al. A comprehensive two-hybrid analysis to explore the yeast protein interactome. In Proceedings of the National Academy of Sciences USA, 98(8) (2001) pp. 4569-4574.
2. Y. Ho et al. Systematic identification of protein complexes in Saccharomyces cerevisae by mass spectrometry. Nature 415 (2002) pp. 180-183.
3. A.C. Gavin et al. Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415 (6868) (2002) pp. 141-147.
4. R. Sharan et al. Conserved patterns of protein interaction in multiple species. In Proceedings of the National Academy of Sciences USA, 102 (2005) pp. 1974-1979.
5. R. Singh et al. Global alignment of multiple protein interaction networks with application to functional orthology detection. In Proceedings of the National Academy of Sciences USA, 105 (2008) pp. 12763-12768.
6. M. Kalaev et al. Fast and accurate alignment of multiple protein networks. In Research in Computational Molecular Biology. Vol. 4955, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg (2008) pp. 246-256.
7. J. Flannick. et al. Automatic parameter learning for multiple network alignment. In Research in Computational Molecular Biology. Vol. 4955, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg (2008) pp. 214-231.
8. C.-S. Liao, K. Lu, M. Baym, R. Singh and B. Berger. IsoRankN: spectral methods for global alignment of multiple protein networks. Proceedings of the International Conference on Intelligent Systems in Molecular Biology, ISMB '09 (2009), pp. 253-258. doi:10.1093/bioinformatics/btp203
9. M. Zaslavskiy, F. Bach, J.-P. Vert. Global alignment of protein-protein interaction networks by graph matching methods. Proceedings of the International Conference on Intelligent Systems in Molecular Biology, ISMB '09 (2009), pp. 259-267. doi:10.1093/bioinformatics/btpl96
10. J. Berg and M. Lassig. Cross-species analysis of biological networks by Bayesian alignment. In Proceedings of the National Academy of Sciences USA, 103 (2006) pp. 10967-10972.
11. J. Dutkowski and J. Tiuryn. Identification of functional modules from conserved ancestral protein-protein interactions. Bioinformatics, 23 (2007) pp. 149-158.
12. B.P. Kelley et al. Conserved pathways within bacteria and yeast as revealed by global protein network alignment. In Proceedings of the National Academy of Sciences USA, 100 (2003) pp. 11394-11399.
13. B.P. Kelley et al. Pathblast: a tool for alignment of protein interaction networks. Nucleic Acids Research, 32 (2004) pp. 83-88.
14. M. Koyutiirk et al. Pairwise Alignment of Protein Interaction Networks. Journal of Computational Biology, 13(2) (2006) pp. 182-199.
15. B.S. Srinivasan et al. Integrated protein interaction networks for 11 microbes. In Research in Computational Molecular Biology. Vol. 3909, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg (2006) pp. 1-14.
16. S. Sahni, T. Gonzales. P-complete approximation problems. Journal of the Association for Computing Machinery, 23 (1976) pp. 555-565.
17. B. Chandra, H. Karloff, and C. Tovey. New results on the old fc-opt algorithm for the TSP. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithm, SODA'94, (1994) pp. 150-159.
18. G.A. Croes. A method for solving traveling salesman problems. Operations Research, 6 (1958) pp. 791-812.
19. T.J.P. Hubbard et al. Ensembl 2007. Nucleoc Acids Research, 35 (2007) pp. 610-617.
20. D.S. Johnson and L.A. McGeoch. The traveling salsman problem: a case study in local optimization. In Local Search in Combinatorial Optimization, John Wiley & Sons, London, (1997) pp. 215-310.
21. F. Viger, M. Latapy. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In Proceedings of the International Computing and Combinatorics Conference, COCOON '05, (2005) pp. 440-449.
22. R. Taylor. Constrained switchings in graphs. Combinatorial Mathematics, 8 (1980) pp. 314-336.
23. M.Y. Kao, T.W. Lam, W.K. Sung, and H.F. Ting. A decomposition theorem for maximum weight bipartite matchings. SIAM Journal of Computing, 31 (2001) pp. 18-26.
24. H.W. Kuhn. The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly, 2 (1955) pp. 83-97.
25. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. The Traveling Salesman Problem, John Wiley & Sons, Chichester (1985).
26. G. Lueker, manuscript, Princeton University, (1976).
27. C.H. Papadimitriou and K. Steiglitz. On the complexity of local search for the traveling salesman problem. SIAM Journal of Computing, 6 (1977) pp. 76-83.
28. Jordan, M. (ed.) Learning in Graphical Models. The MIT Press, Cambridge, (2001).
29. Bandyopadhyay, S. et al. Systematic identification of functional orthologs based on protein network comparison. Genome Research, 16 (2006), pp. 428-435.
30. Zaslavskiy, M. et al. A path following algorithm for graph matching. In Image and Signal Processing, Proceedings of the 3rd International Conference, ICISP, (2008), pp. 329-337.
31. Python Software Foundation, http://www.python.org/psf/
32. A. A. Hagberg, D. A. Schult, and P. J. Swart. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference, SciPy '08, (2008) pp. 11-15.
33. Z. Galil, Efficient Algorithms for Finding Maximum Matchings in Graphs. ACM Computing Surveys, 18:1 (1986), pp. 23-38.
34. IsoRank and IsoRankN. http://isorank.csail.mit.edu Last checked on September 21, 2009.
35. HomoloGene. http://www.ncbi.nlm.nih.gov/homologene Last checked on September 21 13, 2009.
36. L. Chindelevitch. Thoughts on the IsoRank algorithm. Unpublished manuscript.
37. A. A. Tsay, W. S. Lovejoy, D. R. Karger. Random Sampling in Cut, Flow, and Network Design Problems. Mathematics of Operations Research, 24:2 (1999) pp. 383-413.
38. M. E. Newman. Modularity and community structure in networks. In Proceedings of the National Academy of Sciences USA, 103:23 (2006) pp. 8577-8582.