Table of Contents Author Guidelines Submit a Manuscript
BioMed Research International
Volume 2014, Article ID 439476, 11 pages
http://dx.doi.org/10.1155/2014/439476
Review Article

Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks

1Department of Computer Science, University at Albany, 1400 Washington Avenue, Albany, NY 12222, USA
2Department of Genetics, Cell Biology and Anatomy, University of Nebraska Medical Center, College of Medicine, Omaha, NE 68198-5145, USA
3Bioinformatics and Systems Biology Core, University of Nebraska Medical Center, Omaha, NE 68198, USA

Received 14 January 2014; Accepted 19 February 2014; Published 2 April 2014

Academic Editor: Altaf-Ul-Amin

Copyright © 2014 Ru Shen and Chittibabu Guda. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Ito, T. Chiba, R. Ozawa, M. Yoshida, M. Hattori, and Y. Sakaki, “A comprehensive two-hybrid analysis to explore the yeast protein interactome,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 8, pp. 4569–4574, 2001. View at Publisher · View at Google Scholar · View at Scopus
  2. Y. Ho, A. Gruhler, A. Heilbut et al., “Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry,” Nature, vol. 415, no. 6868, pp. 180–183, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. R. Shen, N. C. W. Goonesekere, and C. Guda, “Mining functional subgraphs from cancer protein-protein interaction networks,” BMC Systems Biology, vol. 6, supplement 2, 2012. View at Google Scholar
  4. R. Sharan and T. Ideker, “Modeling cellular machinery through biological network comparison,” Nature Biotechnology, vol. 24, no. 4, pp. 427–433, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, “Basic local alignment search tool,” Journal of Molecular Biology, vol. 215, no. 3, pp. 403–410, 1990. View at Publisher · View at Google Scholar · View at Scopus
  6. G. D. Bader and C. W. V. Hogue, “An automated method for finding molecular complexes in large protein interaction networks,” BMC Bioinformatics, vol. 4, no. 1, p. 2, 2003. View at Google Scholar · View at Scopus
  7. M. Koyutürk, Y. Kim, U. Topkara, S. Subramaniam, W. Szpankowski, and A. Grama, “Pairwise alignment of protein interaction networks,” Journal of Computational Biology, vol. 13, no. 2, pp. 182–199, 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. K. M. Borgwardt, H. P. Kriegel, S. V. N. Vishwanathan et al., “Graph kernels for disease outcome prediction from protein-protein interaction networks,” in Proceedings of the Pacific Symposium on Biocomputing., pp. 4–15, 2007.
  9. B. P. Kelley, B. Yuan, F. Lewitter, R. Sharan, B. R. Stockwell, and T. Ideker, “PathBLAST: a tool for alignment of protein interaction networks,” Nucleic Acids Research, vol. 32, pp. W83–W88, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. H. Bunke and K. Shearer, “A graph distance metric based on the maximal common subgraph,” Pattern Recognition Letters, vol. 19, no. 3-4, pp. 255–259, 1998. View at Google Scholar · View at Scopus
  11. M.-L. Fernández and G. Valiente, “A graph distance metric combining maximum common subgraph and minimum common supergraph,” Pattern Recognition Letters, vol. 22, no. 6-7, pp. 753–758, 2001. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Sanfeliu and K.-S. Fu, “A distance measure between attributed relational graphs for pattern recognition,” IEEE Transactions on Systems, Man and Cybernetics, vol. 13, no. 3, pp. 353–362, 1983. View at Google Scholar · View at Scopus
  13. N. Pržulj, “Biological network comparison using graphlet degree distribution,” Bioinformatics, vol. 23, no. 2, pp. e177–e183, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. O. Kuchaiev, T. Milenković, V. Memišević, W. Hayes, and N. Pržulj, “Topological network alignment uncovers biological function and phylogeny,” Journal of the Royal Society Interface, vol. 7, no. 50, pp. 1341–1354, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. T. Milenković, W. L. Ng, W. Hayes, and N. Pržulj, “Optimal network alignment with graphlet degree vectors,” Cancer Informatics, vol. 9, pp. 121–137, 2010. View at Google Scholar · View at Scopus
  16. O. Kuchaiev and N. Pržulj, “Integrative network alignment reveals large regions of global network similarity in yeast and human,” Bioinformatics, vol. 27, no. 10, Article ID btr127, pp. 1390–1396, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Haussler, “Convolutional kernels on discrete structures,” Technical Report UCSC-CRL-99-10, Computer Science Department, Santa Cruz, Calif, USA, 1999. View at Google Scholar
  18. T. Gärtner, P. Flach, and S. Wrobel, “On graph kernels: hardness results and efficient alternatives,” in Proceedings of the 16th Annual Conference on Learning Theory and 7th Kernel Workshop (COLT/Kernel '03), pp. 129–143, August 2003. View at Scopus
  19. H. Kashima, K. Tsuda, and A. Inokuchi, “Marginalized Kernels Between Labeled Graphs,” in Proceedings of the 20th International Conference on Machine Learning (ICML '03), pp. 321–328, Washington, DC, USA, August 2003. View at Scopus
  20. K. M. Borgwardt and H.-P. Kriegel, “Shortest-path kernels on graphs,” in Proceedings of the 5th IEEE International Conference on Data Mining (ICDM '05), pp. 74–81, November 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. P. Mahé and J.-P. Vert, “Graph kernels based on tree patterns for molecules,” Machine Learning, vol. 75, no. 1, pp. 3–35, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Ramon and T. Gartner, “Expressivity versus efficiency of graph kernels,” in Proceedings of the 1st International Workshop on Mining Graphs, Trees and Sequences, pp. 65–74, 2003.
  23. K. M. Borgwardt, C. S. Ong, S. Schönauer, S. V. N. Vishwanathan, A. J. Smola, and H.-P. Kriegel, “Protein function prediction via graph kernels,” Bioinformatics, vol. 21, no. 1, pp. i47–i56, 2005. View at Publisher · View at Google Scholar · View at Scopus
  24. J. D. Gardiner, A. J. Laub, J. J. Amato, and C. B. Moler, “Solution of the Sylvester matrix equation AXBT+CXDT = E,” ACM Transactions on Mathematical Software, vol. 18, no. 2, pp. 223–231, 1992. View at Publisher · View at Google Scholar · View at Scopus
  25. J. Nocedal and S. J. Wright, Numerical Optimization, Springer Series in Operations Research, Springer, 1999.
  26. N. Shervashidze, S. V. N. Vishwanathan, T. H. Petri et al., “Efficient graphlet kernels for large graph comparison,” in Proceedings of the International Workshop on Artificial Intelligence and Statistics, vol. 5, 2009.
  27. N. Shervashidze and K. M. Borgwardt, “Fast subtree kernels on graphs,” in Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS '09), pp. 1660–1668, December 2009. View at Scopus
  28. B. Weisfeiler and A. A. Lehman, “A reduction of a graph to a canonical form and an algebra arising during this reduction,” Nauchno-Technicheskaya Informatsia, vol. 2, pp. 12–16, 1968. View at Google Scholar
  29. N. Shervashidze, P. Schweitzer, E. J. van Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-Lehman graph kernels,” Journal of Machine Learning Research, vol. 12, pp. 2539–2561, 2011. View at Google Scholar · View at Scopus
  30. F. Towfic, M. Heather, W. Greenlee et al., “Aligning biomolecular networks using modular graph kernels,” in Proceedings of the 9th International Conference on Algorithms in Bioinformatics, pp. 345–361, 2009.
  31. B. P. Kelley, R. Sharan, R. M. Karp et al., “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, vol. 100, no. 20, pp. 11394–11399, 2003. View at Publisher · View at Google Scholar · View at Scopus
  32. R. Sharan, S. Suthram, R. M. Kelley et al., “Conserved patterns of protein interaction in multiple species,” Proceedings of the National Academy of Sciences of the United States of America, vol. 102, no. 6, pp. 1974–1979, 2005. View at Publisher · View at Google Scholar · View at Scopus
  33. M. Kalaev, M. Smoot, T. Ideker, and R. Sharan, “NetworkBLAST: comparative analysis of protein networks,” Bioinformatics, vol. 24, no. 4, pp. 594–596, 2008. View at Publisher · View at Google Scholar · View at Scopus
  34. M. Kalaev, V. Bafna, and R. Sharan, “Fast and accurate alignment of multiple protein networks,” Journal of Computational Biology, vol. 16, no. 8, pp. 989–999, 2009. View at Publisher · View at Google Scholar · View at Scopus
  35. Z. Li, Y. Wang, S. Zhang et al., “Alignment of protein interaction network by integer quadratic programming,” in Proceedings of the 28th EMBS Annual International Conference, New York, NY, USA, 2006.
  36. R. Patro and C. Kingsford, “Global network alignment using multiscale spectral signatures,” Bioinformatics, vol. 28, pp. 3105–3114, 2012. View at Google Scholar
  37. B. Neyshabur, A. Khadem, and S. Hashemifar, “NETAL: a new graph-based method for global alignment of protein-protein interaction networks,” Bioinformatics, vol. 29, pp. 1654–1662, 2013. View at Google Scholar
  38. V. Memisevic and N. Przulj, “C-GRAAL: common-neighbors-based global GRAph ALignment of biological networks,” Integrative Biology, vol. 4, pp. 734–743, 2012. View at Google Scholar
  39. J. Flannick, A. Novak, B. S. Srinivasan, H. H. McAdams, and S. Batzoglou, “Græmlin: general and robust alignment of multiple large interaction networks,” Genome Research, vol. 16, no. 9, pp. 1169–1181, 2006. View at Publisher · View at Google Scholar · View at Scopus
  40. J. Flannick, A. Novak, C. B. Do, B. S. Srinivasan, and S. Batzoglou, “Automatic parameter learning for multiple local network alignment,” Journal of Computational Biology, vol. 16, no. 8, pp. 1001–1022, 2009. View at Publisher · View at Google Scholar · View at Scopus
  41. R. Singh, J. Xu, and B. Berger, “Global alignment of multiple protein interaction networks with application to functional orthology detection,” Proceedings of the National Academy of Sciences of the United States of America, vol. 105, no. 35, pp. 12763–12768, 2008. View at Publisher · View at Google Scholar · View at Scopus
  42. C.-S. Liao, K. Lu, M. Baym, R. Singh, and B. Berger, “IsoRankN: spectral methods for global alignment of multiple protein networks,” Bioinformatics, vol. 25, no. 12, pp. i253–i258, 2009. View at Publisher · View at Google Scholar · View at Scopus
  43. H. Jeong, S. P. Mason, A.-L. Barabási, and Z. N. Oltvai, “Lethality and centrality in protein networks,” Nature, vol. 411, no. 6833, pp. 41–42, 2001. View at Publisher · View at Google Scholar · View at Scopus
  44. M. P. H. Stumpf and M. A. Porter, “Critical truths about power laws,” Science, vol. 335, no. 6069, pp. 665–666, 2012. View at Publisher · View at Google Scholar · View at Scopus
  45. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3–5, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at Scopus
  46. P. Jiang and M. Singh, “SPICi: a fast clustering algorithm for large biological networks,” Bioinformatics, vol. 26, no. 8, Article ID btq078, pp. 1105–1111, 2010. View at Publisher · View at Google Scholar · View at Scopus
  47. I. A. Maraziotis, K. Dimitrakopoulou, and A. Bezerianos, “Growing functional modules from a seed protein via integration of protein interaction and gene expression data,” BMC Bioinformatics, vol. 8, article 408, 2007. View at Publisher · View at Google Scholar · View at Scopus
  48. J. Seo, M. Bakay, P. Zhao et al., “Interactive color mosaic and dendrogram displays for signal/noise optimization in microarray data analysis,” in Proceedings of the IEEE International Conference on Multimedia and Expo, vol. 3, pp. 461–464, 2003.
  49. C. Brun, F. Chevenet, D. Martin, J. Wojcik, A. Guénoche, and B. Jacq, “Functional classification of proteins for the prediction of cellular function from a protein-protein interaction network,” Genome Biology, vol. 5, no. 1, article R6, 2003. View at Google Scholar · View at Scopus
  50. L. R. Dice, “Measures of the amount of ecologic association between species,” Ecology, vol. 26, pp. 297–302, 1945. View at Google Scholar
  51. N. Saitou and M. Nei, “The neighbor-joining method: a new method for reconstructing phylogenetic trees,” Molecular biology and evolution, vol. 4, no. 4, pp. 406–425, 1987. View at Google Scholar · View at Scopus
  52. H. Lu, X. Zhu, H. Liu et al., “The interactome as a tree: an attempt to visualize the protein-protein interaction network in yeast,” Nucleic Acids Research, vol. 32, no. 16, pp. 4804–4811, 2004. View at Publisher · View at Google Scholar · View at Scopus
  53. M. E. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, Article ID 026113, 2004. View at Google Scholar
  54. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, “Link communities reveal multiscale complexity in networks,” Nature, vol. 466, no. 7307, pp. 761–764, 2010. View at Publisher · View at Google Scholar · View at Scopus
  55. R. W. Solava, R. P. Michaels, and T. Milenkovic, “Graphlet-based edge clustering reveals pathogen-interacting proteins,” Bioinformatics, vol. 28, pp. i480–i486, 2012. View at Google Scholar
  56. A. D. King, N. Pržulj, and I. Jurisica, “Protein complex prediction via cost-based clustering,” Bioinformatics, vol. 20, no. 17, pp. 3013–3020, 2004. View at Publisher · View at Google Scholar · View at Scopus
  57. F. Glover, “Tabu search. Part I,” ORSA Journal on Computing, vol. 1, pp. 190–206, 1989. View at Google Scholar
  58. R. B. Altman and S. Raychaudhuri, “Whole-genome expression analysis: challenges beyond clustering,” Current Opinion in Structural Biology, vol. 11, no. 3, pp. 340–347, 2001. View at Publisher · View at Google Scholar · View at Scopus
  59. T. Ideker, O. Ozier, B. Schwikowski, and A. F. Siegel, “Discovering regulatory and signalling circuits in molecular interaction networks,” Bioinformatics, vol. 18, no. 1, pp. S233–S240, 2002. View at Google Scholar · View at Scopus
  60. S. Zhang, X.-M. Ning, C. Ding, and X.-S. Zhang, “Determining modular organization of protein interaction networks by maximizing modularity density,” BMC Systems Biology, vol. 4, no. 2, article 10, 2010. View at Publisher · View at Google Scholar · View at Scopus
  61. F. Vandin, E. Upfal, and B. J. Raphael, “Algorithms for detecting significantly mutated pathways in cancer,” Journal of Computational Biology, vol. 18, no. 3, pp. 507–522, 2011. View at Publisher · View at Google Scholar · View at Scopus
  62. L. Shi, X. Lei, and A. Zhang, “Protein complex detection with semi-supervised learning in protein interaction networks,” Proteome Science, vol. 9, no. 1, article S5, 2011. View at Publisher · View at Google Scholar · View at Scopus
  63. Y. Qi, F. Balem, C. Faloutsos, J. Klein-Seetharaman, and Z. Bar-Joseph, “Protein complex identification by supervised graph local clustering,” Bioinformatics, vol. 24, no. 13, pp. i250–i268, 2008. View at Publisher · View at Google Scholar · View at Scopus
  64. S. M. V. Dongen, Graph clustering by flow simulation [Ph.D. thesis], University of Utrecht, 2002.
  65. The Gene Ontology Consortium, “Gene ontology: tool for the unification of biology,” Nature Genetics, vol. 25, pp. 25–29, 2000. View at Google Scholar
  66. C. Jiang, F. Coenen, and M. Zito, “A survey of frequent subgraph mining algorithms,” The Knowledge Engineering Review, vol. 28, no. 01, pp. 75–105, 2013. View at Google Scholar
  67. M. Kuramochi and G. Karypis, “An efficient algorithm for discovering frequent subgraphs,” Technical Report, University of Minnesota, Department of Computer Science, 2002. View at Google Scholar
  68. X. Yan and J. Han, “gSpan: graph-based substructure pattern mining,” in Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM '02), pp. 721–724, December 2002. View at Scopus
  69. S. Brohée and J. van Helden, “Evaluation of clustering algorithms for protein-protein interaction networks,” BMC Bioinformatics, vol. 7, article 488, 2006. View at Publisher · View at Google Scholar · View at Scopus
  70. M. Dhara and K. K. Shukla, “Comparative performance analysis of RNSC and MCL algorithms on power-law distribution,” Advanced Computing, vol. 3, pp. 19–34, 2012. View at Google Scholar