String edit distance, random walks and graph matching

DOI10.1007/3-540-70659-3_10MaRDI QIDQ4808933zbMATH OpenFDO

Authors Antonio Robles-Kelly, Edwin R. Hancock

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2396/23960104.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Recommendations

• Graph matching using spectral seriation and string edit distance
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Approximation of graph edit distance in quadratic time
• Edit distance based kernel functions for attributed graph matching
• Speeding up graph edit distance computation through fast bipartite matching

Cited in

(9)

• Classes of cost functions for string edit distance
• Period recovery of strings over the Hamming and edit distances
• Graph simplification and matching using commute times
• The graph matching problem
• Graph matching using spectral seriation and string edit distance
• A Probabilistic Analysis of a String Editing Problem and its Variations
• scientific article; zbMATH DE number 7203332 (Why is no real title available?)
• Matching patterns with variables under edit distance
• Calculating distances for dissimilar strings: the shortest path formulation revisited

This page was built for publication: String edit distance, random walks and graph matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808933)