Tree edit distance and maximum agreement subtree

DOI10.1016/J.IPL.2014.09.002MaRDI QIDQ458389zbMATH OpenOpenAlexFDO

Authors Kil-Ho Shin

Publication date 7 October 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2014.09.002

zbMATH Keywords

pattern recognitiongraph algorithmstree edit distancemaximum agreement subtree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12)

Recommendations

• On the agreement of many trees
• scientific article; zbMATH DE number 1113983
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• A survey on tree edit distance and related problems
• scientific article; zbMATH DE number 871929

Cites work

• An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• On the editing distance between unordered labeled trees
• Some MAX SNP-hard results concerning unordered labeled trees
• The Tree-to-Tree Correction Problem

Cited in

(3)

• A theory of subtree matching and tree kernels based on the edit distance concept
• Alignment of trees -- an alternative to tree edit
• Approximation and special cases of common subtrees and editing distance

This page was built for publication: Tree edit distance and maximum agreement subtree

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