The agreement metric for labeled binary trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 736964
- scientific article; zbMATH DE number 1113982
- Approximating maximum agreement forest on multiple binary trees
- Computing the agreement of trees with bounded degrees
- Approximating the maximum agreement forest on k trees
- scientific article; zbMATH DE number 434699
- Computing a consensus of multilabeled trees
- scientific article; zbMATH DE number 1775400
Cites work
- scientific article; zbMATH DE number 434699 (Why is no real title available?)
- scientific article; zbMATH DE number 3698213 (Why is no real title available?)
- An algorithm to find agreement subtrees
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Optimal algorithms for comparing trees with labeled leaves
Cited in
(6)- scientific article; zbMATH DE number 736964 (Why is no real title available?)
- scientific article; zbMATH DE number 434699 (Why is no real title available?)
- An improved bound on the maximum agreement subtree problem
- On the Maximum Agreement Subtree Conjecture for Balanced Trees
- A distance metric on binary trees using lattice-theoretic measures
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
This page was built for publication: The agreement metric for labeled binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340485)