WSM: A novel algorithm for subgraph matching in large weighted graphs

Journal of Intelligent Information Systems

Volumn 38, Issue 3, 2012, Pages 767-784

  Bhattacharjee, Anupam ^a   Jamil, Hasan M ^a  

^a Wayne State University   (United States)

Author keywords

Biological networks; Canonical representation; Weighted graphs; Weighted subgraph matching

Indexed keywords

BIOLOGICAL INTERACTIONS; BIOLOGICAL NETWORKS; BIOLOGICAL PROBLEMS; CANONICAL REPRESENTATIONS; DATA GRAPH; DETECTION PROCESS; DISEASE GENES; EDGE WEIGHTS; FALSE POSITIVE RATES; GRAPH SIZES; MOLECULAR PATHWAYS; NOVEL ALGORITHM; PHYLOGENETIC TREES; PRIORITIZATION; PROTEIN-PROTEIN INTERACTION NETWORKS; SIMILARITY CALCULATION; SIMILARITY MEASUREMENTS; STATE-OF-THE-ART METHODS; SUBGRAPH MATCHING; SUBGRAPHS; UNWEIGHTED GRAPHS; WEIGHTED DATA; WEIGHTED GRAPH;

ACTIVE NETWORKS; ALGORITHMS; GENES; GRAPHIC METHODS; PATTERN MATCHING;

GRAPH THEORY;

EID: 84860547085     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-011-0178-z     Document Type: Article

References (32)

1. HA Almohamad SO Duffuaa 1993 A linear programming approach for the weighted graph matching problem IEEE Transactions on Pattern Analysis and Machine Intelligence 15 5 522 525 10.1109/34.211474
2. Amin, M. S., Bhattacharjee, A., Finley, Jr., R. L., & Jamil, H. (2010a). A stochastic approach to candidate disease gene subnetwork extraction. In ACM international symposium on applied computing (pp. 1534-1538). Sierre, Switzerland.
3. Amin, M. S., Bhattacharjee, A., & Jamil, H. (2010b). A cytoscape based integrative framework for efficient sub-graph isomorphic protein-protein interaction motif lookup. In ACM international symposium on applied computing (pp. 1572-1576). Sierre, Switzerland.
4. Basuchowdhuri, P. (2009). Greedy methods for approximate graph matching with applications for social network analysis. Master's thesis, Louisiana State University.
5. Bhattacharjee, A., & Jamil, H. (2011). CodeBlast: A graph matching approach toward computing functional similarity of interacting networks. Department of Computer Science, Wayne State University.
6. SV Date 2007 Estimating protein function using protein-protein relationships Methods in Molecular Biology 408 12 109 127 10.1007/978-1-59745- 547-3-7
7. Y El-Sonbaty MA Ismail 1998 A new algorithm for subgraph optimal isomorphism Pattern Recognition 31 2 205 218 10.1016/S0031-3203(97)00041-1
8. Fortin, S. (1996). The graph isomorphism problem. Tech. rep., University of Alberta, Edmonton, Alberta, Canada.
9. M Frank P Wolfe 1956 An algorithm for quadratic programming Naval Research Logistics Quarterly 3 95 110 89102 10.1002/nav.3800030109
10. S Gold A Rangarajan 1996 A graduated assignment algorithm for graph matching IEEE Transactions on Pattern Analysis and Machine Intelligence 18 377 388 10.1109/34.491619
11. J Hardy A Singleton 2009 Genomewide association studies and human disease New England Journal of Medicine 360 1759 1768 10.1056/NEJMra0808700
12. T Ideker 2007 Network genomics Ernst Schering Foundation Symposium Proceedings 61 89 115 10.1007/978-3-540-31339-7-5
13. MG Kann 2007 Protein interactions and disease: computational approaches to uncover the etiology of diseases Briefings in Bioinformatics 8 5 333 346 10.1093/bib/bbm031
14. Knossow, D., Sharma, A., Mateus, D., & Horaud, R. (2009). Inexact matching of large and sparse graphs using laplacian eigenvectors. In International workshop on graph-based representations in pattern recognition (pp. 144-153).
15. HW Kuhn 1955 The Hungarian method for the assignment problem Naval Research Logistic Quarterly 2 83 97 10.1002/nav.3800020109
16. B Luo ER Hancock 2001 Structural graph matching using the em algorithm and singular value decomposition IEEE Transactions on Pattern Analysis and Machine Intelligence 23 1120 1136 10.1109/34.954602
17. McKusick, V. A. (1998). Mendelian inheritance in man. A catalog of human genes and genetic disorders (12th ed.). Baltimore: Johns Hopkins University Press.
18. J Munkres 1957 Algorithms for the assignment and transportation problems Journal of the Society of Industrial and Applied Mathematics 5 1 32 38 93429 10.1137/0105003
19. G Navarro 1999 A guided tour to approximate string matching ACM Computing Surveys 33 2001
20. R Raveaux JC Burie JM Ogier 2010 A graph matching method and a graph matching distance based on subgraph assignments Pattern Recognition Letters 31 5 394 406 10.1016/j.patrec.2009.10.011
21. K Riesen H Bunke 2009 Approximate graph edit distance computation by means of bipartite graph matching Image and Vision Computing 27 7 950 959 10.1016/j.imavis.2008.04.004
22. B Schwikowski P Uetz S Fields 2000 A network of protein-protein interactions in yeast Nature Biotechnology 18 12 1257 1261 10.1038/82360
23. Tarapata, Z., & Kasprzyk, R. (2009). An application of multicriteria weighted graph similarity method to social networks analyzing. In International conference on advances in social network analysis and mining (pp. 366-368).
24. Y Tian RC McEachin C Santos DJ States JM Patel 2007 SAGA: A subgraph matching tool for biological graphs Bioinformatics 23 2 232 239 10.1093/bioinformatics/btl571
25. Tohsato, Y., Matsuda, H., & Hashimoto, A. (2000). A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy. In: ISMB (pp. 376-383).
26. P Uetz RL Finley Jr 2005 From protein networks to biological systems FEBS Letters 579 8 1821 1827 10.1016/j.febslet.2005.02.001
27. S Umeyama 1988 An eigendecomposition approach to weighted graph matching problems IEEE Transactions on Pattern Analysis and Machine Intelligence 10 5 695 703 10.1109/34.6778
28. J Yu J Finley L Russell 2009 Combining multiple positive training sets to generate confidence scores for protein-protein interactions Bioinformatics 25 1 105 111 10.1093/bioinformatics/btn597
29. J Yu S Pacifico G Liu R Finley 2008 DroID: The Drosophila Interactions Database, a comprehensive resource for annotated gene and protein interactions BMC Genomics 9 1 461 469 10.1186/1471-2164-9-461
30. M Zaslavskiy F Bach JP Vert 2009 A path following algorithm for the graph matching problem IEEE Transactions on Pattern Analysis and Machine Intelligence 31 2227 2242 10.1109/TPAMI.2008.245
31. MM Zavlanos GJ Pappas 2008 A dynamical systems approach to weighted graph matching Automatica 44 11 2817 2824 2527202 10.1016/j.automatica.2008.04.009
32. Zhao, G., Luo, B., Tang, J., & Ma, J. (2007). Using eigen-decomposition method for weighted graph matching. In ICIC (pp. 1283-1294).