An algorithm to find agreement subtrees
From MaRDI portal
Publication:1901396
DOI10.1007/BF01202269zbMath0825.68493OpenAlexW1970802957MaRDI QIDQ1901396
Grzegorz M. Kubicki, Ewa M. Kubicka, Fred R. McMorris
Publication date: 13 December 1995
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202269
Related Items (9)
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD ⋮ The agreement metric for labeled binary trees ⋮ Computing the unrooted maximum agreement subtree in sub-quadratic time ⋮ An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees ⋮ On the agreement of many trees ⋮ From constrained to unconstrained maximum agreement subtree in linear time ⋮ An improved bound on the maximum agreement subtree problem ⋮ An improved algorithm for the maximum agreement subtree problem ⋮ Kaikoura tree theorems: Computing the maximum agreement subtree
Cites Work
This page was built for publication: An algorithm to find agreement subtrees
