Tree edit distance and maximum agreement subtree

DOI10.1016/j.ipl.2014.09.002zbMath1366.68101OpenAlexW2081957922MaRDI QIDQ458389

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

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

Related Items (1)

A theory of subtree matching and tree kernels based on the edit distance concept

Cites Work

• On the editing distance between unordered labeled trees
• Some MAX SNP-hard results concerning unordered labeled trees
• An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
• The Tree-to-Tree Correction Problem
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS

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