{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:02Z","timestamp":1725563522884},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_23","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T10:05:23Z","timestamp":1282989923000},"page":"244-253","source":"Crossref","is-referenced-by-count":0,"title":["Indexing Tree and Subtree by Using a Structure Network"],"prefix":"10.1007","author":[{"given":"Mingming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shinichiro","family":"Omachi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"23_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The graph isomorphism problem: its structural complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The graph isomorphism problem: its structural complexity. Springer, Heidelberg (1993)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11553595_1","volume-title":"Image Analysis and Processing \u2013 ICIAP 2005","author":"H. Bunke","year":"2005","unstructured":"Bunke, H., Irniger, C., Neuhaus, M.: Graph matching - challenges and potential solutions. In: Roli, F., Vitulano, S. (eds.) ICIAP 2005. LNCS, vol.\u00a03617, pp. 1\u201310. Springer, Heidelberg (2005)"},{"key":"23_CR4","unstructured":"Klein, P.N., Sebastian, T.B., Kimia, B.B.: Shape matching using edit-distance: an implementation. In: SODA, pp. 781\u2013790 (2001)"},{"issue":"9","key":"23_CR5","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1016\/j.patcog.2008.03.011","volume":"41","author":"R.C. Wilson","year":"2008","unstructured":"Wilson, R.C., Zhu, P.: A study of graph spectra for comparing graphs and trees. Pattern Recognition\u00a041(9), 2833\u20132841 (2008)","journal-title":"Pattern Recognition"},{"issue":"7","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"R. Wilson","year":"2005","unstructured":"Wilson, R., Hancock, E., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Ttansactions on Pattern Analysis and Machine Intelligence\u00a027(7), 1112\u20131124 (2005)","journal-title":"IEEE Ttansactions on Pattern Analysis and Machine Intelligence"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45028-9_21","volume-title":"Graph Based Representations in Pattern Recognition","author":"H. Bunke","year":"2003","unstructured":"Bunke, H., Foggia, P., Guidobaldi, C., Vento, M.: Graph clustering using the weighted minimum common supergraph. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol.\u00a02726, pp. 235\u2013246. Springer, Heidelberg (2003)"},{"key":"23_CR8","first-page":"321","volume-title":"ICML","author":"H. Kashima","year":"2003","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Fawcett, T., Mishra, N. (eds.) ICML, pp. 321\u2013328. AAAI Press, Menlo Park (2003)"},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TPAMI.2004.1273924","volume":"26","author":"T.B. Sebastian","year":"2004","unstructured":"Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shapes by editing their shock graphs. IEEE Trans. Pattern Anal. Mach. Intell.\u00a026(5), 550\u2013571 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","volume":"35","author":"M. Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics, Part B\u00a035(3), 503\u2013514 (2005)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"issue":"10","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1016\/j.patcog.2006.04.012","volume":"39","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Bunke, H.: Edit distance-based kernel functions for structural pattern classification. Pattern Recognition\u00a039(10), 1852\u20131863 (2006)","journal-title":"Pattern Recognition"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Sakakibara, Y.: Pair hidden markov models on tree structures. In: ISMB (Supplement of Bioinformatics), pp. 232\u2013240 (2003)","DOI":"10.1093\/bioinformatics\/btg1032"},{"issue":"5","key":"23_CR13","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/j.patcog.2006.09.006","volume":"40","author":"A. Torsello","year":"2007","unstructured":"Torsello, A., Hancock, E.R.: Graph embedding using tree edit-union. Pattern Recognition\u00a040(5), 1393\u20131405 (2007)","journal-title":"Pattern Recognition"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-72903-7_35","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K. Riesen","year":"2007","unstructured":"Riesen, K., Neuhaus, M., Bunke, H.: Graph embedding in vector spaces by means of prototype selection. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol.\u00a04538, pp. 383\u2013393. Springer, Heidelberg (2007)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Bai, X., Hancock, E.R.: Heat kernels, manifolds and graph embedding. In: [20], pp. 198\u2013206","DOI":"10.1007\/978-3-540-27868-9_20"},{"key":"23_CR16","first-page":"2491","volume-title":"CVPR","author":"A. Shokoufandeh","year":"1999","unstructured":"Shokoufandeh, A., Dickinson, S.J., Siddiqi, K., Zucker, S.W.: Indexing using a spectral encoding of topological structure. In: CVPR, pp. 2491\u20132497. IEEE Computer Society, Los Alamitos (1999)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Irniger, C., Bunke, H.: Decision tree structures for graph database filtering. In: [20], pp. 66\u201375","DOI":"10.1007\/978-3-540-27868-9_6"},{"key":"23_CR18","volume-title":"Combinatorial algorithms","author":"L. Ku\u010dera","year":"1990","unstructured":"Ku\u010dera, L.: Combinatorial algorithms. Taylor & Francis, Abington (1990)"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R. Shamir","year":"1999","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. J. Algorithms\u00a033(2), 267\u2013280 (1999)","journal-title":"J. Algorithms"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","year":"2004","unstructured":"Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.): SSPR&SPR 2004. LNCS, vol.\u00a03138. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14980-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:59:59Z","timestamp":1606186799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}