The agreement metric for labeled binary trees

DOI10.1016/0025-5564(94)90012-4zbMath0809.05033OpenAlexW2085251214WikidataQ52370797 ScholiaQ52370797MaRDI QIDQ1340485

Wayne Goddard, Ewa M. Kubicka, Fred R. McMorris, Grzegorz M. Kubicki

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

zbMATH Keywords

binary treelabeled binary treesquadratic algorithmagreement metricagreement tree

Mathematics Subject Classification ID

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

Related Items (3)

The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics ⋮ An improved bound on the maximum agreement subtree problem ⋮ On the Maximum Agreement Subtree Conjecture for Balanced Trees

Uses Software

• PAUP*

Cites Work

• Optimal algorithms for comparing trees with labeled leaves
• Kaikoura tree theorems: Computing the maximum agreement subtree
• An algorithm to find agreement subtrees
• Unnamed Item
• Unnamed Item

This page was built for publication: The agreement metric for labeled binary trees