{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:54:27Z","timestamp":1760079267648},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440116"},{"type":"electronic","value":"9783540706595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-70659-3_10","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T07:47:11Z","timestamp":1180165631000},"page":"104-112","source":"Crossref","is-referenced-by-count":7,"title":["String Edit Distance, Random Walks and Graph Matching"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Robles-Kelly","sequence":"first","affiliation":[]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"issue":"7","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1162\/089976698300017188","volume":"10","author":"R. C. Wilson","year":"1998","unstructured":"R. C. Wilson A. M. Finch and E. R. Hancock. An energy function and continuous edit process for graph matching. Neural Computation, 10(7):1873\u20131894, 1998.","journal-title":"Neural Computation"},{"key":"10_CR2","unstructured":"K. Siddiqi A. Shokoufandeh, S. J. Dickinson and S. W. Zucker. Indexing using a spectral encoding of topological structure. In Proceedings of the Computer Vision and Pattern Recognition, 1998."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Luo Bin and E. R. Hancock. Procrustes alignment with the em algorithm. In 8th International Conference on Computer Analysis of Images and Image Patterns, pages 623\u2013631, 1999.","DOI":"10.1007\/3-540-48375-6_74"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"H. Buke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18, 1997.","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"10_CR5","unstructured":"Fan R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997."},{"issue":"3","key":"10_CR6","first-page":"398","volume":"14","author":"M. A. Eshera","year":"1984","unstructured":"M. A. Eshera and K. S. Fu. A graph distance measure for image analysis. SMC, 14(3):398\u2013408, May 1984.","journal-title":"SMC"},{"issue":"4","key":"10_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. PAMI, 18(4):377\u2013388, April 1996.","journal-title":"PAMI"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"R. Horaud and H. Sossa. Polyhedral object recognition by indexing. Pattern Recognition, 1995.","DOI":"10.1016\/0031-3203(95)00048-8"},{"issue":"2","key":"10_CR9","first-page":"1","volume":"2","author":"L. Lov\u00e1sz","year":"1993","unstructured":"L. Lov\u00e1sz. Random walks on graphs: a survey. Bolyai Society Mathematical Studies, 2(2):1\u201346, 1993.","journal-title":"Bolyai Society Mathematical Studies"},{"key":"10_CR10","first-page":"707","volume":"6","author":"V. I. Levenshtein","year":"1966","unstructured":"V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6:707\u2013710, 1966.","journal-title":"Sov. Phys. Dokl."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Bin Luo and E. R. Hancock. Structural graph matching using the EM algorithm and singular value decomposition. To appear in IEEE Trans. on Pattern Analysis and Machine Intelligence, 2001.","DOI":"10.1109\/34.954602"},{"issue":"6","key":"10_CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/34.506420","volume":"18","author":"B. J. Oommen","year":"1996","unstructured":"B. J. Oommen and K. Zhang. The normalized string editing problem revisited. PAMI, 18(6):669\u2013672, June 1996.","journal-title":"PAMI"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"A. Sanfeliu and K. S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, 13:353\u2013362, 1983.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"G. Scott and H. Longuet-Higgins. An algorithm for associating the features of two images. In Proceedings of the Royal Society of London, number 244 in B, 1991.","DOI":"10.1098\/rspb.1991.0045"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"L. G. Shapiro and R. M. Haralick. Relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 4:595\u2013602, 82.","DOI":"10.1109\/TPAMI.1982.4767312"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"L. S. Shapiro and J. M. Brady. A modal approach to feature-based correspondence. In British Machine Vision Conference, 1991.","DOI":"10.5244\/C.5.11"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00337043","volume":"25","author":"S. Ullman","year":"76","unstructured":"S. Ullman. Filling in the gaps. Biological Cybernetics, 25:1\u20136, 76.","journal-title":"Biological Cybernetics"},{"issue":"5","key":"10_CR18","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"S. Umeyama. An eigen decomposition approach to weighted graph matching problems. PAMI, 10(5):695\u2013703, September 1988.","journal-title":"PAMI"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.","DOI":"10.1007\/978-3-642-05156-2"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"R. A. Wagner. The string-to-string correction problem. Journal of the ACM, 21(1), 1974.","DOI":"10.1145\/321796.321811"},{"issue":"8","key":"10_CR21","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/34.709622","volume":"20","author":"J. T. L. Wang","year":"1998","unstructured":"J. T. L. Wang, B. A. Shapiro, D. Shasha, K. Zhang, and K. M. Currey. An algorithm for finding the largest approximatelycommon substructures of two trees. PAMI, 20(8):889\u2013895, August 1998.","journal-title":"PAMI"},{"issue":"6","key":"10_CR22","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"R. C. Wilson","year":"1997","unstructured":"R. C. Wilson and E. R. Hancock. Structural matching by discrete relaxation. PAMI, 19(6):634\u2013648, June 1997.","journal-title":"PAMI"}],"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\/3-540-70659-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T01:18:22Z","timestamp":1683854302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-70659-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440116","9783540706595"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-70659-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}