Tree edit distance and maximum agreement subtree
From MaRDI portal
(Redirected from Publication:458389)
Recommendations
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)
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)