{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:11:16Z","timestamp":1761621076405},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T00:00:00Z","timestamp":1316476800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10844-011-0178-z","type":"journal-article","created":{"date-parts":[[2011,9,19]],"date-time":"2011-09-19T09:55:56Z","timestamp":1316426156000},"page":"767-784","source":"Crossref","is-referenced-by-count":7,"title":["WSM: a novel algorithm for subgraph matching in large weighted graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Anupam","family":"Bhattacharjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan M.","family":"Jamil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,20]]},"reference":[{"issue":"5","key":"178_CR1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.211474","volume":"15","author":"HA Almohamad","year":"1993","unstructured":"Almohamad, H. A., & Duffuaa, S. O. (1993). A linear programming approach for the weighted graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(5), 522\u2013525.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"178_CR2","doi-asserted-by":"crossref","unstructured":"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\u20131538). Sierre, Switzerland.","DOI":"10.1145\/1774088.1774418"},{"key":"178_CR3","doi-asserted-by":"crossref","unstructured":"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\u20131576). Sierre, Switzerland.","DOI":"10.1145\/1774088.1774424"},{"key":"178_CR4","unstructured":"Basuchowdhuri, P. (2009). Greedy methods for approximate graph matching with applications for social network analysis. Master\u2019s thesis, Louisiana State University."},{"key":"178_CR5","unstructured":"Bhattacharjee, A., & Jamil, H. (2011). CodeBlast: A graph matching approach toward computing functional similarity of interacting networks. Department of Computer Science, Wayne State University."},{"issue":"12","key":"178_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-1-59745-547-3_7","volume":"408","author":"SV Date","year":"2007","unstructured":"Date, S.\u00a0V. (2007). Estimating protein function using protein-protein relationships. Methods in Molecular Biology, 408(12), 109\u2013127.","journal-title":"Methods in Molecular Biology"},{"issue":"2","key":"178_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0031-3203(97)00041-1","volume":"31","author":"Y El-Sonbaty","year":"1998","unstructured":"El-Sonbaty, Y., & Ismail, M. A. (1998). A new algorithm for subgraph optimal isomorphism. Pattern Recognition, 31(2), 205\u2013218.","journal-title":"Pattern Recognition"},{"key":"178_CR8","unstructured":"Fortin, S. (1996). The graph isomorphism problem. Tech. rep., University of Alberta, Edmonton, Alberta, Canada."},{"key":"178_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3, 95\u2013110.","journal-title":"Naval Research Logistics Quarterly"},{"key":"178_CR10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold, S., & Rangarajan, A. (1996). A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18, 377\u2013388.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"178_CR11","doi-asserted-by":"crossref","first-page":"1759","DOI":"10.1056\/NEJMra0808700","volume":"360","author":"J Hardy","year":"2009","unstructured":"Hardy, J., & Singleton, A. (2009). Genomewide association studies and human disease. New England Journal of Medicine, 360, 1759\u20131768.","journal-title":"New England Journal of Medicine"},{"key":"178_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-540-31339-7_5","volume":"61","author":"T Ideker","year":"2007","unstructured":"Ideker, T. (2007). Network genomics. Ernst Schering Foundation Symposium Proceedings, 61, 89\u2013115.","journal-title":"Ernst Schering Foundation Symposium Proceedings"},{"issue":"5","key":"178_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1093\/bib\/bbm031","volume":"8","author":"MG Kann","year":"2007","unstructured":"Kann, M. G. (2007). Protein interactions and disease: computational approaches to uncover the etiology of diseases. Briefings in Bioinformatics, 8(5), 333\u2013346.","journal-title":"Briefings in Bioinformatics"},{"key":"178_CR14","doi-asserted-by":"crossref","unstructured":"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.\u00a0144\u2013153).","DOI":"10.1007\/978-3-642-02124-4_15"},{"key":"178_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2, 83\u201397.","journal-title":"Naval Research Logistic Quarterly"},{"key":"178_CR16","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B Luo","year":"2001","unstructured":"Luo, B., & Hancock, E. R. (2001). Structural graph matching using the em algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23, 1120\u20131136.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"178_CR17","doi-asserted-by":"crossref","DOI":"10.56021\/9780801857423","volume-title":"Mendelian inheritance in man. A catalog of human genes and genetic disorders","author":"VA McKusick","year":"1998","unstructured":"McKusick, V. A. (1998). Mendelian inheritance in man. A catalog of human genes and genetic disorders (12th ed.). Baltimore: Johns Hopkins University Press.","edition":"12"},{"issue":"1","key":"178_CR18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society of Industrial and Applied Mathematics, 5(1), 32\u201338.","journal-title":"Journal of the Society of Industrial and Applied Mathematics"},{"key":"178_CR19","first-page":"2001","volume":"33","author":"G Navarro","year":"1999","unstructured":"Navarro, G. (1999). A guided tour to approximate string matching. ACM Computing Surveys, 33, 2001.","journal-title":"ACM Computing Surveys"},{"issue":"5","key":"178_CR20","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.patrec.2009.10.011","volume":"31","author":"R Raveaux","year":"2010","unstructured":"Raveaux, R., Burie, J. C., & Ogier, J. M. (2010). A graph matching method and a graph matching distance based on subgraph assignments. Pattern Recognition Letters, 31(5), 394\u2013406.","journal-title":"Pattern Recognition Letters"},{"issue":"7","key":"178_CR21","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., & Bunke, H. (2009). Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, 27(7), 950\u2013959.","journal-title":"Image and Vision Computing"},{"issue":"12","key":"178_CR22","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1038\/82360","volume":"18","author":"B Schwikowski","year":"2000","unstructured":"Schwikowski, B., Uetz, P., & Fields, S. (2000). A network of protein-protein interactions in yeast. Nature Biotechnology, 18(12), 1257\u20131261.","journal-title":"Nature Biotechnology"},{"key":"178_CR23","doi-asserted-by":"crossref","unstructured":"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.\u00a0366\u2013368).","DOI":"10.1109\/ASONAM.2009.33"},{"issue":"2","key":"178_CR24","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2007","unstructured":"Tian, Y., McEachin, R. C., Santos, C., States, D. J., & Patel, J. M. (2007). SAGA: A subgraph matching tool for biological graphs. Bioinformatics, 23(2), 232\u2013239.","journal-title":"Bioinformatics"},{"key":"178_CR25","unstructured":"Tohsato, Y., Matsuda, H., & Hashimoto, A. (2000). A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy. In: ISMB (pp. 376\u2013383)."},{"issue":"8","key":"178_CR26","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.1016\/j.febslet.2005.02.001","volume":"579","author":"P Uetz","year":"2005","unstructured":"Uetz, P., & Finley,\u00a0Jr., R. L. (2005). From protein networks to biological systems. FEBS Letters, 579(8), 1821\u20131827.","journal-title":"FEBS Letters"},{"issue":"5","key":"178_CR27","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S. (1988). An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5), 695\u2013703.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"178_CR28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1093\/bioinformatics\/btn597","volume":"25","author":"J Yu","year":"2009","unstructured":"Yu, J., Finley, J., & Russell,\u00a0L. (2009). Combining multiple positive training sets to generate confidence scores for protein-protein interactions. Bioinformatics, 25(1), 105\u2013111.","journal-title":"Bioinformatics"},{"issue":"1","key":"178_CR29","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1186\/1471-2164-9-461","volume":"9","author":"J Yu","year":"2008","unstructured":"Yu, J., Pacifico, S., Liu, G., & Finley, R. (2008). DroID: The Drosophila Interactions Database, a comprehensive resource for annotated gene and protein interactions. BMC Genomics, 9(1), 461\u2013469.","journal-title":"BMC Genomics"},{"key":"178_CR30","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., & Vert, J. P. (2009). A path following algorithm for the graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31, 2227\u20132242.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"178_CR31","doi-asserted-by":"crossref","first-page":"2817","DOI":"10.1016\/j.automatica.2008.04.009","volume":"44","author":"MM Zavlanos","year":"2008","unstructured":"Zavlanos, M. M., & Pappas, G. J. (2008). A dynamical systems approach to weighted graph matching. Automatica, 44(11), 2817\u20132824.","journal-title":"Automatica"},{"key":"178_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, G., Luo, B., Tang, J., & Ma, J. (2007). Using eigen-decomposition method for weighted graph matching. In ICIC (pp. 1283\u20131294).","DOI":"10.1007\/978-3-540-74171-8_131"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-011-0178-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-011-0178-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-011-0178-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T19:00:59Z","timestamp":1686337259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-011-0178-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,20]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s10844-011-0178-z","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,20]]}}}