Computing approximate tree edit distance using relaxation labeling

DOI10.1016/S0167-8655(02)00255-6MaRDI QIDQ4417661zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrea Torsello, Edwin R. Hancock

Publication date 29 July 2003

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(02)00255-6

zbMATH Keywords

Edit distanceShape recognitionShock treesTree matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 1844616
• A survey on tree edit distance and related problems
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• A constrained edit distance between unordered labeled trees
• scientific article; zbMATH DE number 1796978

Cited in

(7)

• XML application schema matching using similarity measure and relaxation labeling
• Edit distance-based kernel functions for structural pattern classification
• Learning Tree Languages
• Heuristics for the generalized median graph problem
• scientific article; zbMATH DE number 2043356 (Why is no real title available?)
• scientific article; zbMATH DE number 1844616 (Why is no real title available?)
• A survey of graph edit distance

This page was built for publication: Computing approximate tree edit distance using relaxation labeling

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