The agreement metric for labeled binary trees

DOI10.1016/0025-5564(94)90012-4zbMATH Open0809.05033OpenAlexW2085251214WikidataQ52370797 ScholiaQ52370797MaRDI QIDQ1340485FDOQ1340485

Authors: Wayne Goddard, Ewa Kubicka, Grzegorz Kubicki, F. R. McMorris 

Publication date: 19 December 1994

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(94)90012-4

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

zbMATH Keywords

binary treelabeled binary treesquadratic algorithmagreement metricagreement tree

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Kaikoura tree theorems: Computing the maximum agreement subtree
• Optimal algorithms for comparing trees with labeled leaves
• Title not available (Why is that?)
• An algorithm to find agreement subtrees
• Title not available (Why is that?)

Cited In (6)

• On the Maximum Agreement Subtree Conjecture for Balanced Trees
• A distance metric on binary trees using lattice-theoretic measures
• Title not available (Why is that?)
• An improved bound on the maximum agreement subtree problem
• Title not available (Why is that?)
• The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics

Uses Software

• PAUP*

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)